Category: Blog
-
How to Learn Dominator-Tree Algorithms: Control-Flow Graphs, Immediate Dominators, Lengauer–Tarjan and SSA
A beginner-to-professional Learning Hall guide to dominator-tree algorithms: CFGs, dominator sets, immediate dominators, Lengauer–Tarjan, dominance frontiers, SSA, testing and compiler use.
-
How to Learn Retroactive Data Structures: Editing the Past, Partial and Full Retroactivity, Timelines and Consistency
A beginner-to-professional Learning Hall guide to retroactive data structures: editable operation timelines, partial and full retroactivity, persistence differences, consistency, complexity and testing.
-
How to Learn Fusion Trees: Word-RAM Parallelism, Key Sketches, Predecessor Search and Sublogarithmic Queries
A beginner-to-professional Learning Hall guide to fusion trees: predecessor search, distinguishing-bit sketches, word-level parallelism, O(log n / log w) queries, proofs, testing and practical limits.
-
How to Learn Eertrees (Palindromic Trees): Distinct Palindromes, Suffix Links, Online Updates and Factorization
A beginner-to-professional Learning Hall guide to eertrees: distinct palindromes, two roots, suffix links, online insertion, occurrence propagation, factorization, dynamic extensions and testing.
-
How to Learn Li Chao Trees: Dynamic Line Envelopes, Point Queries, Segment Variants and DP Optimization
A beginner-to-professional Learning Hall guide to Li Chao trees: dynamic lower envelopes, midpoint routing, point queries, DP optimization, segment variants, persistence, numerical safety and testing.
-
How to Learn Mo’s Algorithm: Offline Range Queries, Block Ordering, Window Updates and Locality Optimization
A beginner-to-professional Learning Hall guide to Mo’s algorithm: offline range queries, block ordering, add/remove window invariants, complexity, Hilbert locality, updates, testing and professional trade-offs.
