Tag
potential-method
- 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
- Oct 9, 2025 The Potential Function Behind the Inverse-Ackermann Union-Find Bound Disjoint-set forests with union by rank and path compression cost O(m alpha(n)) for m operations, and the proof is a ranked accounting over nodes rather than any single tree shape. algorithms
- Aug 19, 2024 Splaying: Amortized Restructuring Without Stored Balance How a splay step moves an accessed node to the root, why zig-zig pairing matters, and how a potential function yields O(log n) amortized access with zero metadata. data structures