The bit probe complexity measure revisited

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

Volumn 665 LNCS, Issue , 1993, Pages 662-671

  Miltersen, Peter Bro ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT-PROBE COMPLEXITY; COMPLEXITY MEASURES; SPACE BOUNDS;

PROBES;

EID: 0042209290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56503-5_65     Document Type: Conference Paper

References (13)

1. L. Adleman, Two theprems on random polynomial time, 19th Symp. Found, of Comp. Sci. (1978), 75-83.
2. M. Ajtai, A lower bound for finding predecessors in Yao’s cell probe model, Combinar torica 8 (1988) 235-247.
3. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, Proc. 27th IEEE FOCS (1986) 337-347.
4. H. Chernoif, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Statist. 23 (1952), 493-509.
5. P. Elias, R. A. Flower, The complexity of some simple retrieval problems, J. Ass. Comp. Mach. 22 (1975), 367-379.
6. T. Hagerup, C. Riib, A guided tour of Chernoif bounds, Inform. Proces. Lett. 33 (1990), 305-308.
7. L. Lovàsz, Communication complexity: A survey, in “Paths, Flows, and VLSI Layout”, edited by B.H. Korte, Springer Verlag, Berlin New York (1990).
8. K. Mehlhorn, E.M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, Proc. 14th ACM STOC (1982) 330-337.
9. A.R. Meyer, L. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, IEEE 13th Annual Symposium on Switching and Automata Theory (1972), 125-129.
10. P.B. Miltersen, On-line reevaluation of functions, Aarhus University Tech. Report DAIMI PB-380.
11. S. Sairam, J.S. Vitter, R. Tamassia, A complexity theoretic approach to incremental computation, these proceedings.
12. A. C.-C. Yao, Some complexity questions related to distributive computing, Proc. 11th ACM STOC (1979) 209-213.
13. A. C.-C. Yao, Should tables be sorted?, JACM 28 (1981), 615-628.