Category: Blog
-
How to Learn Kirkpatrick’s Planar Point-Location Algorithm: Triangulations, Low-Degree Independent Sets, Hierarchies and O(log n) Queries
Learn Kirkpatrick planar point location from triangulated subdivisions and orientation tests to low-degree independent sets, hierarchical retriangulation, O(log n) queries and robust geometry engineering.
-
How to Learn the Hirschberg–Sinclair Leader-Election Algorithm: Bidirectional Probes, Exponential Radius, Active Candidates and O(n log n) Messages
Learn Hirschberg–Sinclair leader election from unique IDs and ring symmetry to bidirectional exponential probes, candidate elimination, O(n log n) message complexity and distributed-system engineering.
-
How to Learn Pippenger Multi-Scalar Multiplication: Scalar Windows, Buckets, Running Sums and High-Performance Elliptic-Curve MSM
Learn Pippenger multi-scalar multiplication from ordinary scalar multiplication to window decomposition, bucket accumulation, running sums, complexity, security caveats and modern zero-knowledge engineering.
-
How to Learn the Jonker–Volgenant Assignment Algorithm: Reduced Costs, Shortest Augmenting Paths, Dual Variables and LAPJV Engineering
Learn Jonker–Volgenant linear assignment from cost matrices and dual variables to reduced costs, shortest augmenting paths, dense/sparse variants, rectangular LAPJV engineering and modern SciPy practice.
-
How to Learn the Ryu Float-to-String Algorithm: IEEE 754, Shortest Round-Trip Decimals, Integer Arithmetic and Fast Number Formatting
Learn Ryu floating-point formatting from IEEE 754 and shortest round-trip decimals to interval reasoning, powers of five, fixed-width integer arithmetic, correctness, testing and production formatting.
-
How to Learn the Schieber–Vishkin LCA Algorithm: Inlabels, Ascendant Bitsets, Path Heads and O(1) Lowest-Common-Ancestor Queries
Learn Schieber–Vishkin lowest common ancestors from rooted-tree basics to inlabels, vertical paths, ascendant bitsets, path-head jumps, linear preprocessing and O(1) online queries.
