Worst case constant time priority queue

MaRDI QIDQ2768343zbMATH OpenFDO

Authors Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro

Publication date 30 January 2002

zbMATH Keywords

discrete priority queue

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 871899
• Worst-case data structures for the priority queue with attrition
• Worst-case optimal priority queues via extended regular counters
• Worst-case efficient external-memory priority queues
• A parallel priority queue with constant time operations
• Strictly implicit priority queues: on the number of moves and worst-case time
• Priority queues
• Tight(er) worst-case bounds on dynamic searching and priority queues
• Priority Queues with Setup Times
• scientific article; zbMATH DE number 31705

Cited in

(3)

• Worst-case data structures for the priority queue with attrition
• Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
• Worst-case optimal priority queues via extended regular counters

This page was built for publication: Worst case constant time priority queue

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