A new trade-off for deterministic dictionaries

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

Volumn 1851, Issue , 2000, Pages 22-31

  Pagh, Rasmus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DETERMINISTICS; INSTRUCTION SET; LINEAR SPACES; MEMBERSHIP QUERY; QUERY TIME; TIME LOG; TRADE OFF; UNIT COST;

ECONOMIC AND SOCIAL EFFECTS;

EID: 84880301630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.7146/brics.v7i4.20132     Document Type: Conference Paper

References (15)

1. [1] Arne Andersson and Mikkel Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proceedings of the 32th Annual ACM Symposium on Theory of Computing (STOC 2000), New York, 2000. ACM Press.
2. [2] Paul Beame and Faith Fich. Optimal bounds for the predecessor problem. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC '99), pages 295-304, New York, 1999. ACM Press.
3. [3] Martin Dietzfelbinger, Joseph Gil, Yossi Matias, and Nicholas Pippenger. Polyno-mial hash functions are reliable (extended abstract). In Proceedings of the 19th In-ternational Colloquium on Automata, Languages and Programming (ICALP '92), volume 623 of Lecture Notes in Computer Science, pages 235-246, Berlin, 1992. Springer-Verlag.
4. [4] Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23(4):738-761, August 1994.
5. [5] Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Automata, languages and programming (Coventry, 1990), pages 6-19. Springer, New York, 1990.
6. [6] James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. J. Comput. System Sci., 38(1):86-124, 1989. 18th Annual ACM Symposium on Theory of Computing (Berkeley, CA, 1986).
7. [7] Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544, 1984.
8. [8] Michael L. Fredman and Dan E. Willard. Surpassing the information-theoretic bound with fusion trees. J. Comput. System Sci., 47:424-436, 1993.
9. [9] Torben Hagerup. Sorting and searching on the word RAM. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS '98), pages 366-398. Springer, Berlin, 1998.
10. [10] Torben Hagerup. Fast deterministic construction of static dictionaries. In Proceed-ings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pages 414-418, New York, 1999. ACM.
11. [11] Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and de-terministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pages 556-563, New York, 1998. ACM.
12. [12] Rasmus Pagh. Faster deterministic dictionaries. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pages 487-493, New York, 2000. ACM.
13. [13] R. Sundar. A lower bound on the cell probe complexity of the dictionary problem. Manuscript, 1993.
14. [14] P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In 16th Annual Symposium on Foundations of Computer Science (Berkeley, Calif., 1975), pages 75-84, Long Beach, Calif., 1975. IEEE Computer Society.
15. [15] Andrew Chi Chih Yao. Should tables be sorted? J. Assoc. Comput. Mach., 28(3):615-628, 1981.