Simpler and faster dictionaries on the AC0 RAM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 79-90

  Hagerup, Torben ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FAST RETRIEVALS; INSTRUCTION SET; LOWER BOUNDS; MODERATE VALUE; QUERY TIME; UPPER BOUND; W-BIT WORDS; WORD LENGTH;

AUTOMATA THEORY;

EID: 22044433265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055042     Document Type: Conference Paper

References (10)

1. 0 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.
2. 0 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.
3. J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), pp. 143-154.
4. S. A. Cook and R. A. Reckhow, Time bounded random access machines, J. Comput. System Sci. 7 (1973), pp. 354-375.
5. 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.
6. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with 0(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), pp. 538-544.
7. M. Fürst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Syst. Theory 17 (1984), pp. 13-27.
8. 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.
9. 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.
10. Y. Mansour, N. Nisan, and P. Tiwari, The computational complexity of universal hashing, Theoret. Comput. Sci. 107 (1993), pp. 121-133.