Category: Blog
-
How to Learn Rollback DSU: Reversible Union-Find, Offline Dynamic Connectivity and Time-Segment Recursion
A Learning Hall guide to rollback DSU: make union-find reversible, preserve union-by-size, process edge lifetimes offline, and solve dynamic connectivity through segment-tree-over-time recursion.
-
How to Learn MinHash: Jaccard Similarity, Random Permutations, Signatures and Locality-Sensitive Hashing
A Learning Hall guide to MinHash: understand Jaccard similarity, why minimum hashes estimate set overlap, how signatures reduce comparison cost, and how LSH turns similarity estimation into candidate retrieval.
-
How to Learn Heavy-Hitter Algorithms: Misra–Gries, Space-Saving, Error Bounds and Streaming Frequency
A Learning Hall guide to heavy-hitter algorithms: understand Misra–Gries counters, Space-Saving replacement, deterministic error bounds and how streaming systems find frequent items without storing every frequency.
-
How to Learn Cuckoo and Quotient Filters: Fingerprints, Relocation, Deletion and Approximate Membership
A Learning Hall guide to modern approximate-membership filters: understand fingerprints, cuckoo relocation, quotient–remainder addressing, deletion, false positives and workload trade-offs.
-
How to Learn the Ricart–Agrawala Algorithm: Logical Clocks, Deferred Replies, Distributed Mutual Exclusion and Failure Handling
Learn the Ricart–Agrawala distributed mutual-exclusion algorithm from beginner to professional level: logical clocks, request ordering, deferred replies, correctness, message cost and failure handling.
-
How to Learn the Bully Leader-Election Algorithm: Failure Detection, Election Cascades, Coordinator Recovery and Split-Brain Limits
Learn the Bully leader-election algorithm from beginner to professional level: election cascades, failure detection, coordinator recovery, message cost, partitions, split brain and modern system limits.
