How Path Compression Flattens the Union-Find Tree Structure
Path compression dramatically speeds up Union-Find operations by collapsing intermediate nodes during finds, turning deep trees into almost flat structures.
Data Structures
The Hidden Mechanics of Lock Striping in Hash Maps
A deep dive into lock striping, revealing how it reduces contention in concurrent hash maps and how to apply it effectively.
Tracing the Limits of Cuckoo Hashing Eviction Chains
We dissect the mechanics of cuckoo hashing, derive worst‑case chain length bounds, and present engineering tricks that prevent long eviction cascades.
The Hidden Memory Costs of Layered Skip Lists
A deep dive into the often‑overlooked memory footprint of layered skip lists, revealing hidden costs and offering strategies to keep them efficient.
Implementing Lock-Free Priority Queues Using Compare and Swap
A deep dive into lock‑free priority queues, explaining the compare‑and‑swap technique, data‑structure choices, correctness proofs, and real‑world benchmarks.