Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the weighted path length of binary search trees for unknown access probabilities

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

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

  • 142 Accesses

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. Gilbert, E.N. and Moore, E.F., Variable-length binary encodings. Bell System Tech. J., 38 (1959), 933–968.

    Google Scholar 

  2. Knuth, D.E., Optimum binary search trees. Acta Informatica, 1 (1971), 14–25.

    Article  Google Scholar 

  3. —, The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison — Wesley Publ. Co., Reading, Mass., 1973.

    Google Scholar 

  4. Fredman, M.L., Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees. Proc. 7th Annual ACM Symposium on Theory of Computing, 1975.

    Google Scholar 

  5. Mehlhorn, K., A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6 (1977), 235–239.

    Article  Google Scholar 

  6. Allan, B. and Munro, I., Self-organizing binary search. Proc. 17th Symp. on Foundations of Computer Science, 1976.

    Google Scholar 

  7. Mehlhorn, K., Dynamic binary search. Lecture Notes Computer Science, Vol. 52. Springer — Verlag, Berlin etc., 1977, 323–336.

    Google Scholar 

  8. Kerridge, D.F., Inaccuracy and inference. J. Royal Stat. Soc., B 23 (1961), 184–194.

    Google Scholar 

  9. Golstein, E.G., Konvexe Optimierung. Akademie — Verlag, Berlin, 1973.

    Google Scholar 

  10. Fischer, Th., Über universelle Codierungen und Suchprozesse. Schriftenreihe Weiterbildungszentrum MKR, Heft 30 (1978), Technical University of Dresden.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics DDR, Technical University of Dresden, 8027, Dresden, German Democratic Republic

    Thomas Fischer

Authors
  1. Thomas Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischer, T. (1979). On the weighted path length of binary search trees for unknown access probabilities. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics