2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1975)
Oct. 13, 1975 to Oct. 15, 1975
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1975.26
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.
P. van Emde Boas, "Preserving order in a forest in less than logarithmic time", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 75-84, 1975, doi:10.1109/SFCS.1975.26