A note on the construction of the data structure ``deap

DOI10.1016/0020-0190(89)90094-XzbMath0684.68033MaRDI QIDQ1825631

Jingsen Chen, Thomas Strothotte, Svante Carlsson

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

priority queueheapdeapdouble-ended priority queuepriority deque

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Related Items

Multidimensional heaps and complementary range searching ⋮ An optimal parallel algorithm to construct a deap ⋮ Recurrence relations on heaps ⋮ A Survey on Priority Queues

Cites Work

• Unnamed Item
• Bounds for min-max heaps
• Min-max heaps and generalized priority queues
• A data structure for manipulating priority queues

This page was built for publication: A note on the construction of the data structure ``deap