Correspondence-based data structures for double-ended priority queues

DOI10.1145/351827.351828zbMath1071.68520OpenAlexW1592193513MaRDI QIDQ5463395

Kyun-Rak Chong, Sartaj K. Sahni

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.351828

zbMATH Keywords

data structurespriority queuesheapssplay treesdouble-ended priority queuescorrespondence-based data structuresruntime efficiency

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Two new methods for constructing double-ended priority queues from priority queues ⋮ Multidimensional heaps and complementary range searching ⋮ Unnamed Item ⋮ A Survey on Priority Queues

This page was built for publication: Correspondence-based data structures for double-ended priority queues