Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space (1990)
by
Kurt Mehlhorn
,
Stefan Näher
| Venue: | Information Processing Letters |
| Citations: | 13 - 0 self |
BibTeX
@ARTICLE{Mehlhorn90boundedordered,
author = {Kurt Mehlhorn and Stefan Näher},
title = {Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space},
journal = {Information Processing Letters},
year = {1990},
volume = {35}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space [E77].
Citations
| 74 | Log-Logarithmic Worst-Case Range Queries are Possible - Willard - 1983 |
| 43 | Data Structures and Algorithms - Mehlhorn - 1984 |
| 42 | DB: A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time - Johnson - 1982 |
| 26 | New trie data structures which support very fast search operations - Willard - 1984 |
| 14 | Algorithms in a restricted universe - Karlsson - 1985 |
| 1 | Tarjan: "Upper and Lower Bounds for the Dictionary Problem - Dietzfelbinger, Karlin, et al. - 1988 |
| 1 | Emde Boas: "An O(n log log n) On-line Algorithm for the InsertExtract -Min Problem", Rep - v - 1974 |
| 1 | Emde Boas: "Preserving Order in a Forest in Less than Logarithmic Time and Linear Space - v - 1977 |
| 1 | Zijlstra: "Design and Implementation of an Efficient Priority Queue - Boas, Kaas, et al. |
| 1 | Szemeredi: "Storing a Sparse Table with O(1) Worst Case Access Time - Fredman, Komlos, et al. - 1984 |
| 1 | Naher: "LEDA, a Library of Efficient Data Types and Algorithms - Mehlhorn, St - 1989 |
