Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Min-max heaps and generalized priority queues
Communications of the ACM
The pairing heap: a new form of self-adjusting heap
Algorithmica
SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The Deap—A double-ended heap to implement double-ended priority queues
Information Processing Letters
A mergeable double-ended priority queue
The Computer Journal - Special issue on data structures
Diamond deque: a simple data structure for priority deques
Information Processing Letters
Pairing heaps: experiments and analysis
Communications of the ACM
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Fundamentals of Data Structures in C++
Fundamentals of Data Structures in C++
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Multidimensional heaps and complementary range searching
Information Processing Letters
Hi-index | 0.00 |
We describe three general methods--total, dual, and leaf correspondence--that may be used to derive efficient double-ended priority queues from single-ended priority queues. These methods are illustrated by developing double-ended priority queues based on the classical heap. Experimental results indicate that the leaf-correspondence method generally leads to a faster double-ended priority queue than either total or dual correspondence. On randomly generated test sets, however, the splay tree outperforms the tested correspondence-based double-ended priority queues.