Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1986: Mathematical Foundations of Computer Science 1986 pp 168–176Cite as

Developing implicit data structures

  • Invited Lectures
  • Conference paper
  • First Online:

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

Abstract

We present a new, and basically simple, algorithm for maintaining a structure supporting insert, delete and search in O(log2 n) with no storage requirements other than that of the data itself.

This work was supported by Natural Science and Engineering Research Council of Canada grant No. A-8237 and AT&T Bell Laboratories.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adel'son-Vel'skii, G.M., and Landis, Y.M., An Algorithm for the Organization of Information, Dokl. Akad. Nauk. SSR 146, 263–266.

    Google Scholar 

  2. Alt, H., Mehlhorn, K. and Munro, J.I., Partial Match Retrieval in Implicit Data Structures, IPL (19,2) 61–65 (1984).

    Google Scholar 

  3. Bentley, J.L., Multidimensional Binary Search Trees Used for Associative Searching, CACM 18, 506–516 (1975).

    Google Scholar 

  4. Borodin, A.B., Fich, F.E., Meyer auf der Heide, F., Upfal, E. and Wigderson, A., A Tradeoff Between Search and Update Times for the Implicit Dictionary Problem, Proc. ICALP '86.

    Google Scholar 

  5. Durian, B., Quicksort Without a Stack, this volume.

    Google Scholar 

  6. Floyd, R.W., Algorithm 245: Tressort 3, JACM 7, 701 (1964).

    Google Scholar 

  7. Frederickson, G.N., Self Organizing Heuristics for Implicit Data Structures, SIAM J. on Comp. 13, 277–291 (1984).

    Google Scholar 

  8. Frederickson, G.N., Recursively Rotated Orders and Implicit Data Structures: A Lower Bound, Theor. Comp. Sci. 29, 75–85 (1985).

    Google Scholar 

  9. Frederickson, G.N., Implicit Data Structures for the Dictionary Problem, JACM 30, 1, 80–94 (1983).

    Google Scholar 

  10. Munro, J.I., An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time, Proc. 25th Annual IEEE Symp. on FOCS, 369–374, Oct. 1984. Expanded version available as Research Report CS-84-20, Department of Computer Science, University of Waterloo, Aug. 1984.

    Google Scholar 

  11. Munro, J.I., and Suwanda, H., Implicit Data Structures for Fast Search and Update, J. Computer Syst. Sci 21, 236–250 (1980).

    Google Scholar 

  12. Munro, J.I., and Poblete, P.V., Searchability in Merging and Implicit Data Structures, Proc. 10th ICALP, 527–535, Jul. 1983, appears as Lecture Notes in Computer Science 154, Springer-Verlag.

    Google Scholar 

  13. Williams, J.W.J., Algorithm 232: Heapsort, CACM 7, 347–348 (1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    J. Ian Munro

Authors
  1. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Munro, J.I. (1986). Developing implicit data structures. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016241

Download citation

  • DOI: https://doi.org/10.1007/BFb0016241

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation