Category: Blog
-
How to Learn Graph Partitioning Algorithms: Edge Cuts, Kernighan–Lin, Fiduccia–Mattheyses and Multilevel Methods
A beginner-to-professional learning manual for graph partitioning: balanced cuts, edge-cut objectives, Kernighan–Lin, Fiduccia–Mattheyses, spectral ideas, multilevel coarsening/refinement and production partitioners.
-
How to Learn Compiler Data-Flow Analysis Algorithms: Control-Flow Graphs, Liveness, Reaching Definitions and Fixed Points
A beginner-to-professional learning manual for compiler data-flow analysis: CFGs, gen/kill equations, forward and backward analysis, worklists, fixed points, liveness, reaching definitions, dominance and SSA.
-
How to Learn Conflict-Free Replicated Data Type (CRDT) Algorithms: State Merges, Concurrent Updates, OR-Sets and Convergence
A beginner-to-professional learning manual for CRDT algorithms: replicated state, concurrency, merge laws, counters, OR-Sets, causal context, delta-state designs, validation and production trade-offs.
-
How to Learn Byzantine Fault-Tolerant Consensus Algorithms: Quorums, PBFT, View Changes and HotStuff
A beginner-to-professional learning manual for Byzantine fault-tolerant consensus: quorums, PBFT, view changes, partial synchrony, HotStuff, quorum certificates and professional fault testing.
-
How to Learn External-Sorting Algorithms: Runs, Multiway Merge, Replacement Selection and I/O-Aware Design
A beginner-to-professional learning manual for external sorting: sorted runs, multiway merge, replacement selection, I/O complexity, stability, spill semantics and professional systems validation.
-
How to Learn Numerical Root-Finding Algorithms: Bisection, Newton, Secant, Brent and Safeguarded Solvers
A beginner-to-professional learning manual for numerical root finding: bisection, Newton, secant, Brent, safeguarded solvers, convergence, conditioning and validation.
