Abstract
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for both searching and updating. This natural question dates back to the heap of Williams and Floyd in the sixties and relates to the fundamental issue whether additional space besides those for the keys gives more computational power in dictionaries and how data ordering helps. Implicit data structures were introduced in the eighties with this goal, providing the best bound of O(log2 n) time, until a recent result showing O(log2 n/log log n) time. In this paper we describe the flat implicit tree, which is the first data structure obtaining O(log n) time for search and (amortized) update using an array of n cells.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Franceschini, G., Grossi, R. Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput Syst 39, 321–345 (2006). https://doi.org/10.1007/s00224-005-1167-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1167-9