On tape versus core; An application of space efficient perfect hash functions to the invariance of space

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 391-400

  Slot, C ^a   Van Emde Boas, P ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

COMPLEXITY THEORY; CONSTANT FACTORS; PERFECT HASHING; SPACE EFFICIENT; STANDARD MODEL;

HASH FUNCTIONS;

EID: 65749117216     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808705     Document Type: Conference Paper

References (22)

1. Aho, A.V., J.E. Hopcroft & J.D. Ullman, The design and analysis of computer algorithms, Addison Wesley 1974.
2. Bertoni, A., G. Mauri & N. Sabadini, A characterization of the class of functions computable in polynomial time on random access machines, Proc. ACM SIGACT STOC 13 (1983) 168-176.
3. Chandra, A.K. & L. Stockmeyer, Alternation, JACM 28 (1981) 114-133.
4. Cook, S.A. & R.A. Reckhow, Time bounded random access machines, JCSS 7 (1973) 354-375.
5. Davis, M., Computability and Unsolvability, Me Graw Hill, 1958.
6. Davis, M., Why Godel didn't have Curch's thesis, Information and Control 54 (1982) 3-24.
7. Fredman, F.L., J. Komlos & E. Szemeredi, Storing a sparse table with 0(1) worst case access time, Proc. IEEE FOCS 23 (1982), 165-169.
8. Goldschlager, L.M., A universal interconnection pattern for parallel computers, JACM 29 (1982) 1073-1086.
9. Hartmanis, J., Observations about the development of theoretical computer science, Ann. Hist. Comp. 3 (1981) 42-51.
10. Hartmanis, J. & J. Simon, On the structure of feasible computations, in M. Rubinoff & M.C. Yovits eds., Advances in aomputers 14, Acad. Press 1976, pp. 1-43.
11. Kleene, S.C., Origins of recursive function theory, Ann. Hist. Comp. 3 (1981) 52-67.
12. Mehlhorn, K., On the program size of perfect universal hash functions, Proc. IEEE FOCS 23 (1982), 170-175.
13. Mehlhorn, K., Data structures and efficient algorithms, Springer, 1984, chap. 3.2.3, (Perfect hashing)(to appear).
14. Minsky, M., Computation, finite and infinite machines, Prentice Hall, 1972.
15. Pratt, V.R. & L.J. Stockmeyer, A characterization of the power of vector machines, JCSS 12 (1976) 198-221.
16. Savitch, W.J., Relations between deterministic and nondeterministic tape complexities, JCSS 4 (1970) 177-192.
17. Savitch, W.J., The influence of the machine model on computational complexity, in J.K. Lenstra, A.H.G. Rinnooy Kan & P. van Emde Boas, Interfaces between computer science and operations research, Math. Centre Tracts 99 (1978), pp. 1-32.
18. Savitch, W.J. & M.J. Stimson, Time bounded random access machines with parallel processing, JACM 26 103-118.
19. Sipser, M., Halting space-bounded computations, Note, Theor. Comp. Sci. 10 (1980) 335-337.
20. van Emde Boas, P., The second machine class, models of parallellism, in J.K. Lenstra & J. van Leeuwen eds., Parallel computers and computation, CWI tracts (to appear).
21. Wiedermann, J., Deterministic and nondeterministic simulation of the RAM by the Turingmachine, Proc. IFIP 1983, Paris.
22. Yao, A.C., Should tables be sorted?, JACM 28 (1981) 615-628.