186 citations · 243 across the 28 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 7 cited
Fibonacci Heaps Revisited
Haim Kaplan, Robert E. Tarjan, Uri Zwick
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time. We explore the design spa…
cs.DS2014
A Back-to-Basics Empirical Study of Priority Queues
Daniel H. Larkin, Siddhartha Sen, Robert E. Tarjan
The theory community has proposed several new heap variants in the recent past which have remained largely untested experimentally. We take the field back to the drawing board, wit…