Skip to content

csen2025.org

csen2025.org

Add Listing
Balanced trees compared in two schemes.
  • Dr. Ingrid Falk-Weller
  • October 5, 2026
  • (0)
  • Algorithms

Two Balancing Schemes With the Same Promise

I remember sitting in a windowless server room during my first industry residency, staring at a performance trace that made absolutely no sense. The textbook said our choice of data structure was optimal, yet the latency spikes were screaming that…

Read More
Node per character tries for prefix search.
  • Dr. Ingrid Falk-Weller
  • October 3, 2026
  • (0)
  • Algorithms

One Node Per Character Buys Instant Prefix Search

I remember sitting in a windowless lab during my postdoc, staring at a profiler that showed our string matching was eating our entire CPU budget. Everyone around me was suggesting we throw more hardware at the problem or implement some…

Read More
Diagram explaining heaps and priority queues.
  • Dr. Ingrid Falk-Weller
  • September 27, 2026
  • (0)
  • Algorithms

A Heap Is Only Half Sorted and That Is Enough

I spent three years in academia watching students struggle through textbook proofs for heaps and priority queues, only to see them hit a wall the moment they tried to implement them in a real-world distributed system. There is this pervasive,…

Read More
Fenwick trees explained through prefix sums.
  • Dr. Ingrid Falk-Weller
  • September 19, 2026
  • (0)
  • Algorithms

Prefix Sums That Survive Updates

I remember sitting in a windowless lab during my second year of grad school, staring at a whiteboard covered in increasingly grotesque segment tree implementations. Everyone around me was treating these structures like some kind of holy grail of competitive…

Read More
Visualizing segment trees and range queries.
  • Dr. Ingrid Falk-Weller
  • September 10, 2026
  • (0)
  • Algorithms

Answering Range Questions Faster Than Reading the Range

I spent most of my PhD watching brilliant engineers implement segment trees for range queries when a simple Fenwick tree or even a sorted array would have been faster, leaner, and significantly easier to debug. There is this pervasive, almost…

Read More
Visualizing convex hull algorithms with points.
  • Dr. Ingrid Falk-Weller
  • September 1, 2026
  • (0)
  • Algorithms

Wrapping a Set of Points in the Tightest Possible Rubber Band

I remember sitting in a windowless lab during my postdoc, staring at a simulation that was crawling to a halt because I had blindly implemented a textbook version of Graham scan for a dataset that was essentially a perfect circle.…

Read More
Computational geometry basics: cross product line.
  • Dr. Ingrid Falk-Weller
  • August 25, 2026
  • (0)
  • Algorithms

The Cross Product Answers Which Side of a Line You Are on

I remember sitting in a windowless lab during my postdoc, staring at a simulation that was supposed to be “mathematically perfect” but was actually hemorrhaging errors because I’d ignored how floating-point math handles nearly parallel lines. It was a humbling…

Read More
Applying the sweep line technique to problems.
  • Dr. Ingrid Falk-Weller
  • August 17, 2026
  • (0)
  • Algorithms

Turning a Two Dimensional Problem Into an Ordered List

I remember sitting in a windowless lab during my second year of PhD work, staring at a simulation that was grinding to a halt because I had tried to brute-force every possible intersection in a massive geometric dataset. I was…

Read More
Visualizing interval problems and sweeping.
  • Dr. Ingrid Falk-Weller
  • August 11, 2026
  • (0)
  • Algorithms

Sort by One End and the Problem Collapses

I remember sitting in a windowless server room three years ago, staring at a telemetry dashboard that insisted everything was nominal, even as our distributed state drifted into total chaos. We were using a standard sweeping technique to monitor our…

Read More
Visualizing the longest common subsequence algorithm.
  • Dr. Ingrid Falk-Weller
  • August 6, 2026
  • (0)
  • Algorithms

The Algorithm Behind Every Diff You Have Ever Read

I remember sitting in a windowless grad lab at 2:00 AM, staring at a stack of textbook proofs for the longest common subsequence that felt more like religious liturgy than actual engineering. The textbooks always presented the solution as this…

Read More
  • 1
  • 2
  • 3
  • 4

Recent Posts

  • Tune Their Method as Hard as You Tuned Yours
  • Never Build a Query by Concatenating a String
  • Decoupling Services Couples Them to the Broker
  • Letting the Model Decide What to Look at
  • Two Balancing Schemes With the Same Promise

Recent Comments

No comments to show.

Archives

  • October 2026
  • September 2026
  • August 2026
  • July 2026
  • June 2026
  • May 2026
  • April 2026
  • March 2026
  • February 2026
  • January 2026

Categories

  • Algorithms
  • Machine Learning
  • Research Practice
  • Software Engineering
  • Systems

2026© All right reserved by Radiustheme