scientific article; zbMATH DE number 2111732

MaRDI QIDQ4825541zbMATH OpenFDO

Authors Jyrki Katajainen, Fabio Vitale

Publication date 28 October 2004

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Priority queues and sorting for read-only data
• Worst-case efficient external-memory priority queues
• On RAM Priority Queues
• Diamond deque: A simple data structure for priority deques
• Min-max heaps and generalized priority queues

Cited in

(5)

• Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
• Priority queues and sorting for read-only data
• Diamond deque: A simple data structure for priority deques
• Two new methods for constructing double-ended priority queues from priority queues
• Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals

This page was built for publication:

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