Skip to main content
SpringerLink
Log in

Partial match retrieval in implicit data structures

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

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. Bentley, J.L., "Multidimensional Binary Search Trees Used for Associative Searching", CACM 18, 9 (Sept. 1975), pp. 509–516.

    Google Scholar 

  2. Frederickson, G.N., "Implicit data Structures with Fast Update", IEEE FOCS 1980, pp. 255–259.

    Google Scholar 

  3. Frederickson, G.N., "Implicit Data Structures for the Dictionary Problem", Report CS-81-8, The Pennsylvania State University.

    Google Scholar 

  4. Ghosh, S.P. and C.T. Abraham, "Application of Finite Geometry in File Organization for Records with Multiple-valued Attributes", IBM J. on Res. Develop. 12 (1968), pp. 180–187.

    Google Scholar 

  5. Munro, J.I., "A Multikey Search Problem", Proc. 17th Annual Allerton Conf. (Oct. 1979).

    Google Scholar 

  6. Munro, J.I. and H. Suwanda, "Implicit Data Structures", Proc. 11th Annual ACM Symp. on Theory of Computing, May 1979, pp. 108–117.

    Google Scholar 

  7. Rivest, R.L., "Partial Match Retrieval Algorithms", SIAM J. on Comp., 5, 1 (March 1976), pp. 19–50.

    Google Scholar 

  8. Yao, A.C., "Should Tables be Sorted?" IEEE FOCS 1978, pp. 22–27.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA

    Helmut Alt

  2. Fachbereich Informatik, Universität des Saarlandes, 6600, Saarbrücken, W. Germany

    Kurt Mehlhorn

  3. Department of Computer Science, University of Waterloo, N2L3G1, Waterloo, Ontario, Canada

    J. Ian Munro

Authors
  1. Helmut Alt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alt, H., Mehlhorn, K., Munro, J.I. (1981). Partial match retrieval in implicit data structures. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation