A General Technique for Implementation of Efficient Priority Queues

A General Technique for Implementation of Efficient Priority Queues (1994)

by Peter Høyer

Venue:	In Proc. 3rd Israel Symposium on Theory of Computing and Systems
Citations:	9 - 0 self

Datum	Value	Source
TITLE	A general technique for implementation of efficient priority queues	INFERENCE
AUTHOR NAME	Peter Hyer	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Mathematics and Computer Science; Odense University	SVM HeaderParse 0.2
AUTHOR ADDR	Denmark	SVM HeaderParse 0.1
ABSTRACT	This paper presents a very general technique for the implementation of mergeable priority queues. The amortized running time is O(log n) for DeleteMin and Delete, and \Theta(1) for all other standard operations. In particular, the operation DecreaseKey runs in amortized constant time. The worst-case running time is O(logn) or better for all operations. Several examples of mergeable priority queues are given. The examples include priority queues that are particular well suited for extenal storage. The space requirement is only two pointers and one information field per item. The technique is also used to implement mergeable, double-ended priority queues. For these queues, the worst-case time bound for insertion is \Theta(1), which improves the best previously known bound. For the other operations, the time bounds are the same as the best previously known bounds, worst-case as well as amortized. 1	SVM HeaderParse 0.1
YEAR	1994	INFERENCE
VENUE	In Proc. 3rd Israel Symposium on Theory of Computing and Systems	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	57--66	INFERENCE
TECH	Technical Report 33	INFERENCE
CITATIONS	14 found	ParsCit 1.0