Lower bounds for static dictionaries on RAMs with bit operations but no multiplication

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

Volumn 1099, Issue , 1996, Pages 442-453

  Miltersen, Peter Bro ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT-OPERATIONS; BOOLEAN OPERATIONS; INDIRECT ADDRESSING; LOWER BOUNDS; QUERY TIME;

AUTOMATA THEORY;

EID: 84922328375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_149     Document Type: Conference Paper

References (17)

1. A. Andersson. Sublogarithmic searching without multiplications. In Proc. FOCS, 1995.
2. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? In Proc. 27th ACM Symposium on Theory of Computing (STOC), pages 427-436, 1995.
3. 0RAMs: Query time is sufficient and necessary. Manuscript, 1996.
4. A.M. Ben-Amram and Z. Galil. When can we sort in o(ralog n) time? In Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS), pages 538-546, 1993.
5. N.H. Bshouty. Lower bounds for the complexity of functions in a realistic RAM model. In Proc. Israel Symposium on the Theory of Computing and Systems, pages 12-23, 1992.
6. J.L. Carter and M.N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sei., 18:143-154, 1979.
7. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17:427-462, 1988.
8. P.F. Dietz. Optimal algorithms for hst indexing and subset rank. In Proc. First Workshop on Algorithms and Data Structures (WADS), pages 39-46, 1989.
9. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. Technical Report 513, Fachbereich Informatik, Universität Dortmund, 1993.
10. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer Auf Der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23:738-761, 1994.
11. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
12. F. Fich and P.B. Miltersen. Tables should be sorted (on random access machines). In Proc. 4th International Workshop on Algorithms and Data Structures (WADS), pages 482-493, 1995.
13. M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(l) worst case access time. J. Ass. Comp. Mach., 31:538-544, 1984.
14. M.L. Fredman and D.E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
15. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and Systems Sciences, 30:209-221, 1985.
16. M. Thorup. On RAM priority queues. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 59-67, 1996.
17. A.C. Yao. Should tables be sorted? J. Ass. Comp. Mach., 28:615-628, 1981.