A mergeable double-ended priority queue

Authors:
S. Olariu;C. M. Overstreet;Z. Wen
Affiliations:
-;-;-
Venue:
The Computer Journal - Special issue on data structures
Year:
1991

Citing 0
Cited 3

Correspondence-based data structures for double-ended priority queues

Journal of Experimental Algorithmics (JEA)
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Multidimensional heaps and complementary range searching

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract