Adaptive Fibonacci and Pairing Heaps
Abstract
This brief note presents two adaptive heap data structures and conjectures on running times.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.