Tag
decrease-key
- Sep 9, 2026 Fibonacci Heaps and the Amortised Case for Decrease-Key How deferred consolidation makes meld and decrease-key constant amortised, what the potential function measures, and why the theoretical win rarely survives contact with memory. data structures
- Jan 10, 2026 Indexed Binary Heaps and the Cost of Decrease-Key Why changing a key in place needs a handle from element to heap slot, how the position map is maintained through sifts, and what lazy deletion trades away. data structures
- Dec 3, 2024 Priority Queues for Dijkstra: Decrease-Key, Lazy Deletion, and Buckets The four practical queue designs behind the same greedy loop, what each costs per operation, and how integer weight bounds turn a comparison heap into an array of buckets. algorithms
- Nov 18, 2022 Pairing Heaps and the Two-Pass Merge How a self-adjusting heap replaces rank bookkeeping with a left-to-right then right-to-left merge, why melding is constant time, and what the amortised bounds actually are. data structures