An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
The pairing heap: a new form of self-adjusting heap
Algorithmica
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A data structure for manipulating priority queues
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Animating algorithms with XTANGO
ACM SIGACT News
Do algorithm animations assist learning?: an empirical study and analysis
CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems
Information theoretic implications for pairing heaps
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
High-Performance Algorithm Engineering for Computational Phylogenetics
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
High-Performance Algorithm Engineering for Computational Phylogenetics
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An approach to certificate path discovery in mobile Ad Hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Parameterized self-adjusting heaps
Journal of Algorithms
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
ACM Transactions on Algorithms (TALG)
Pairing heaps with O(log log n) decrease cost
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Lightweight Delegated Privileges Revocation Scheme Based on Coding
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
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
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
SIAM Journal on Computing
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 48.22 |
The pairing heap has recently been introduced as a new data structure for priority queues. Pairing heaps are extremely simple to implement and seem to be very efficient in practice, but they are difficult to analyze theoretically, and open problems remain. It has been conjectured that they achieve the same amortized time bounds as Fibonacci heaps, namely, O(log n) time for delete and delete_min and O(1) for all other operations, where n is the size of the priority queue at the time of the operation. We provide empirical evidence that supports this conjecture. The most promising algorithm in our simulations is a new variant of the twopass method, called auxiliary twopass. We prove that, assuming no decrease_key operations are performed, it achieves the same amortized time bounds as Fibonacci heaps.