Worst-case efficient priority queues
Conference
·
OSTI ID:416785
- Aarhus Univ. (Denmark)
An implementation of priority queues is presented that supports the operations MAKEQUEUE, FINDMIN, INSERT, MELD and DECREASEKEY in worst case time O(1) and DFLETEMIN and DELETE in worst case time O(log n). The space requirement is linear. The data structure presented is the first achieving this worst case performance.
- OSTI ID:
- 416785
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
On RAM priority queues
A lock-free priority queue design based on multi-dimensional linked lists
Concurrent operations on priority queues
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416786
A lock-free priority queue design based on multi-dimensional linked lists
Journal Article
·
Fri Apr 03 00:00:00 EDT 2015
· IEEE Transactions on Parallel and Distributed Systems
·
OSTI ID:1237474
Concurrent operations on priority queues
Journal Article
·
Sat Dec 31 23:00:00 EST 1988
· Commun. ACM; (United States)
·
OSTI ID:5871864