Abstract
We consider the static dictionary problem of using O(n) w-bit words to store n w- bit keys for fast retrieval on a w-bit AC0 RAM, i.e., on a RAM with a word length of w bits whose instruction set is arbitrary, except that each instruction must be realizable through an unbounded-fanin circuit of constant depth and wO(1) size. We improve the best known upper bound for moderate values of w relative to n. If w/log n = (log log n)O(1), query time (log log log n)O(1) is achieved, and if additionally w/log n ≥ (log log n)1+ε for some fixed ε > 0, the query time is constant. For both of these special cases, the best previous upper bound was O(log log n). A new lower bound is also observed.
Part of this work was carried out while the author held a visiting position at the Department of Computer Science, University of Copenhagen, Denmark.
Preview
Unable to display preview. Download preview PDF.
References
A. Andersson, P. B. Miltersen, S. Riis, and M. Thorup, Static dictionaries on AC0 RAMs: Query time θ(√ log n/log log n) is necessary and sufficient, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp.441–450.
A. Andersson, P. B. Miltersen, S. Riis, and M. Thorup, Dictionaries on AC0 RAMs: Query time θ(√ log n/log log n) is necessary and sufficient, Tech. Rep. No. RS-97-14, BRICS, Dept. of Computer Science, Univ. of Aarhus, 1997.
J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), pp. 143–154.
S. A. Cook and R. A. Reckhow, Time bounded random access machines, J. Comput. System Sci. 7 (1973), pp. 354–375.
M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen, A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25 (1997), pp.19–51.
M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), pp. 538–544.
M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Syst. Theory 17 (1984), pp. 13–27.
T. Hagerup, Sorting and searching on the word RAM, in Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 1373, pp. 366–398.
J. Hastad, Almost optimal lower bounds for small depth circuits, in Proc. 18th Annual ACM Symposium on Theory of Computing (STOC 1986), pp. 6–20.
Y. Mansour, N. Nisan, and P. Tiwari, The computational complexity of universal hashing, Theoret. Comput. Sci. 107 (1993), pp. 121–133.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagerup, T. (1998). Simpler and faster dictionaries on the AC0 RAM. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055042
Download citation
DOI: https://doi.org/10.1007/BFb0055042
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive