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-; TRN: 96:005887-0008
- Resource Relation:
- Conference: 7. annual ACM-SIAM symposium on discrete algorithms, Atlanta, GA (United States), 28-30 Jan 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms; PB: 596 p.
- 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
Relaxed heaps
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:416785
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:416785
Relaxed heaps
Journal Article
·
Tue Nov 01 00:00:00 EST 1988
· Commun. ACM; (United States)
·
OSTI ID:416785
+1 more