ALGORITHMS & COMPUTING HUB · COMPLETE INDEX
Complete Algorithms & Computing Index
Browse topics alphabetically, or choose a subject route below.
About this index
This is the live orphan-control layer for Algorithms and Computing. The rendered result count is authoritative and updates with WordPress ownership, so every owned title remains a direct route to its article.
Boundary: the registry excludes Science-owned articles routed by the Science Hub and Learning Runtime-owned articles routed by the Learning Runtime Hub. Older Blog material outside this recovered Algorithms and Computing estate is also excluded.
Choose a Corridor First
The map groups the field by learning job. The registry below is alphabetical so a reader who already knows a name can find it quickly.
Live Alphabetical Registry
This list is deliberately title-only. Open an article for its learning progression, evidence, implementation guidance, limits and professional context.
Index Policy
This is a verified recovery index, not a claim that computing is permanently finished. The ten-corridor hub explains relationships; this registry prevents loss. Articles may connect to Science, Mathematics, learning or professional practice without surrendering their computational owner.
Overlapping Coverage — Choose by Scope
Both routes are preserved. Use the narrower article whose stated scope matches the problem; the pairing below prevents similar coverage from becoming invisible.
- B+ Tree coverage: B+ Tree Algorithms · B+ Trees for database-index engineering
- Bridson Poisson-disk sampling: Active lists, background grids and O(N) sampling · Blue noise, minimum-distance grids and fast sampling
- Delta-Stepping: Distance buckets and relaxation rounds · Parallel relaxation and throughput
- Exact Cover: Algorithm X, matrices and heuristics · Dancing Links and reversible backtracking
- Fast Marching Method: Accepted fronts and arrival-time computation · O(N log N) arrival-time computation
- Treaps: BST order and expected logarithmic time · Expected balance and sequence design
- Aho–Corasick: One-pass multi-pattern matching · Streaming multi-pattern search
- Gale–Shapley / stable matching: Deferred acceptance and market-design reasoning · Blocking pairs and proposer optimality
- Knuth optimisation: Interval recurrences and monotone split points · Quadrangle inequalities and O(n²) speedups
Explore the wider eduKate Sengkang library
English Archive · Mathematics Archive · Science Archive · Examination Archive · Learning Runtime Archive · Algorithms & Computing Archive · Castle Registry · All Pages & Posts
