Title: Preserving order in a forest in less than logarithmic time
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.
Publication Year: 1975
Publication Date: 1975-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 185
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot