Self-adjusting binary search trees
Journal of the ACM (JACM)
The pairing heap: a new form of self-adjusting heap
Algorithmica
SIAM Journal on Computing
Sequential access in splay trees takes linear time
Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Amortized complexity of data structures
Amortized complexity of data structures
Pairing heaps: experiments and analysis
Communications of the ACM
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Pairing heaps with costless meld
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A priority queue with the time-finger property
Journal of Discrete Algorithms
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
Pairing heaps are shown to have constant amortized time insert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to perform an extract-min on an element x is O(log min(n, k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensitive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.