DocumentCode
2176675
Title
Preserving order in a forest in less than logarithmic time
Author
van Emde Boas, P.
fYear
1975
fDate
13-15 Oct. 1975
Firstpage
75
Lastpage
84
Abstract
We present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose priorities are selected from the interval 1...n, with an average and worst case processing time of O(log log n) per instruction. The structure is used to obtain a mergeable heap whose time requirements are about as good.
Keywords
Algorithm design and analysis; Binary trees; Computer aided instruction; Data structures; Runtime; Sorting; Testing; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1975., 16th Annual Symposium on
Conference_Location
USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1975.26
Filename
4567861
Link To Document