Algorithms

• The Quiet Calculus of Probabilistic Commutativity · 2025-09-27

  A practical calculus for quantifying when non-commutative operations in distributed systems can be safely executed without heavyweight coordination.

• Bloom Filters and Probabilistic Data Structures: Trading Certainty for Speed · 2024-08-22

  Explore how Bloom filters, Count-Min sketches, and HyperLogLog sacrifice perfect accuracy for dramatic space and time savings—and learn when that trade-off makes sense.

• Reverse Indexing and Inverted Files: How Search Engines Fly · 2023-07-19

  Tokenization, postings lists, skip pointers, and WAND: a tour of the data structures that make full‑text search fast.

• Garbage Collection Algorithms: From Mark-and-Sweep to ZGC · 2022-11-22

  A comprehensive exploration of garbage collection algorithms, from classic mark-and-sweep to modern concurrent collectors like G1, Shenandoah, and ZGC. Learn how automatic memory management works and the trade-offs that shape collector design.

• Algorithm Design
• Algorithms
• Algorithms (4th ed.)
• Introduction to Algorithms (3rd ed.)
• Introduction to Parallel Computing (2nd ed.)
• The Art of Computer Programming, Vols. 1–4A