Tables should be sorted (On random access machines)

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

Volumn 955, Issue , 1995, Pages 482-493

  Fich, Faith ^a   Miltersen, Peter Bro ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINARY SEARCH; INSTRUCTION SET; MEMBERSHIP QUERY; MODEL OF COMPUTATION; QUERY TIME; RANDOM ACCESS MACHINES;

DATA STRUCTURES;

EID: 84958045747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60220-8_87     Document Type: Conference Paper

References (16)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A.M. Ben-Amram and Z. Galil, Lower bounds for data structure problems on RAMs. In Proc. 32th IEEE Symposium on Foundations of Computer Science, 1991, pages 622-631.
3. J.L. Bentley, Programming Pearls. Addison-Wesley, Reading, MA, 1986.
4. A. Brodnik and J. Ian Munro, Membership in constant time and minimum space. In Proc. 2nd European Symposium on Algorithms 1994, pages 7281.
5. S.A. Cook and R.A. Reckhow, Time bounded random access machines. JCSS, vol. 7, 1973, pages 354-375
6. A. Fiat and M. Naor, Implicit O(l) probe search. SIAM J. Computing vol. 22, 1993, pages 1-10
7. A. Fiat, M. Naor, J.P. Schmidt, and A. Seigel, Nonoblivious hashing. /, ACM vol. 39, 1992, pages 764-782
8. M.L. Fredman, J. Komlos, and E. Szemeredi, Storing a sparse table with O(l) worst case access time. /. ACM, vol. 31, 1984, pages 538-544
9. M.L. Fredman and M.E. Saks, The cell probe complexity of dynamic data structures. In Proc. 21st Ann. ACM Symp. on Theory of Computing, 1989, pages 345-354.
10. D.E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
11. W. Maass, On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines. J. Symbolic Logic, vol. 53, 1988, pages 1098-1109.
12. P.B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity. In Proc. 27th ACM Symposium on Theory of Computing, 1995, to appear
13. W. Paul and J. Simon, Decision trees and random access machines. In Logic and Algorithmic, monograph no. 30 de l'enseignement mathematique, Univeriste de Geneve, 1982.
14. D.D. Sleator and R.E. Tarjan, Self-Adjusting Binary Search Trees. J. ACM, vol. 32, 1985, pages 652-686.
15. R. E. Tarjan and A.C. Yao, Storing a sparse table. C. ACM, vol. 22, 1979, pages 606-611.
16. A.C. Yao, Should tables be sorted? J. ACM, vol. 28, 1981, pages 615-628.