Skip to main content
SpringerLink
Log in

The bit probe complexity measure revisited

  • Conference paper
  • First Online:
STACS 93 (STACS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 665))

Included in the following conference series:

Abstract

A static data structure problem consists of a set of data D, a set of queries Q and a function f with domain D × Q. Given a space bound b, a (good) solution to the problem is an encoding e: D → {0,1}b, so that for any y, f(x,y) can be determined (quickly) by probing e(x). The worst case number of probes needed is C b (f), the bit probe complexity of f. We study the properties of the complexity measure C b(·).

Work partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract No. 7141 (project ALCOM II).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman, Two theorems on random polynomial time, 19th Symp. Found. of Comp. Sci. (1978), 75–83.

    Google Scholar 

  2. M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica 8 (1988) 235–247.

    Google Scholar 

  3. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, Proc. 27th IEEE FOCS (1986) 337–347.

    Google Scholar 

  4. H. Chernoff, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Statist. 23 (1952), 493–509.

    Google Scholar 

  5. P. Elias, R.A. Flower, The complexity of some simple retrieval problems, J. Ass. Comp. Mach. 22 (1975), 367–379.

    Google Scholar 

  6. T. Hagerup, C. Rüb, A guided tour of Chernoff bounds, Inform. Proces. Lett. 33 (1990), 305–308.

    Google Scholar 

  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).

    Google Scholar 

  8. K. Mehlhorn, E.M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, Proc. 14th ACM STOC (1982) 330–337.

    Google Scholar 

  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.

    Google Scholar 

  10. P.B. Miltersen, On-line reevaluation of functions, Aarhus University Tech. Report DAIMI PB-380.

    Google Scholar 

  11. S. Sairam, J.S. Vitter, R. Tamassia, A complexity theoretic approach to incremental computation, these proceedings.

    Google Scholar 

  12. A. C.-C. Yao, Some complexity questions related to distributive computing, Proc. 11th ACM STOC (1979) 209–213.

    Google Scholar 

  13. A. C.-C. Yao, Should tables be sorted?, JACM 28 (1981), 615–628.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Ny Munkegade, Aarhus University, Building 540, DK-8000, Aarhus C, Denmark

    Peter Bro Miltersen

Authors
  1. Peter Bro Miltersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miltersen, P.B. (1993). The bit probe complexity measure revisited. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation