Mergeable double-ended priority queues

DOI10.1142/S0129054199000022MaRDI QIDQ5248987zbMATH OpenOpenAlexFDO

Authors Seonghun Cho, Sartaj Sahni

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054199000022

zbMATH Keywords

complexitydouble-ended priority queuesperformance

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The relaxed min-max heap: A mergeable double-ended priority queue
• Melding priority queues
• Two new methods for constructing double-ended priority queues from priority queues
• Min-max heaps and generalized priority queues
• Correspondence-based data structures for double-ended priority queues

Cites work

• Min-max heaps and generalized priority queues

Cited in

(15)

• A pointer-free data structure for merging heaps and min-max heaps
• Queue-mergesort
• The relaxed min-max heap: A mergeable double-ended priority queue
• A survey on priority queues
• Melding priority queues
• scientific article; zbMATH DE number 1003250 (Why is no real title available?)
• scientific article; zbMATH DE number 2065978 (Why is no real title available?)
• The K-D heap: An efficient multi-dimensional priority queue
• Catenable double-ended queues
• Correspondence-based data structures for double-ended priority queues
• scientific article; zbMATH DE number 6469130 (Why is no real title available?)
• Diamond deque: A simple data structure for priority deques
• The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
• Two new methods for constructing double-ended priority queues from priority queues
• Multidimensional heaps and complementary range searching

This page was built for publication: Mergeable double-ended priority queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248987)