Skip to main content
SpringerLink
Log in

Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

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

Kurzfassung

Es wird gezeigt, daß die mittlere Anzahl von Balancierungs-operationen (Rotationen und Doppelrotationen) bei gewichtsbalancierten Bäumen konstant ist.

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.

Bibliography

  1. Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974

    Google Scholar 

  2. Adel'son-Velskii, Laudis: An algorithm for the organization of information, Soviet. Math. Dokl, 3, 1259–1262, 1962

    Google Scholar 

  3. Blum N., Mehlhorn, K.: On the average number of rebalancing operations in weight-balanced trees, Technischer Bericht A-78/06, FB 10 der Universität des Saarlandes, 1978

    Google Scholar 

  4. Bayer, Schkolnik: Concurrency of Operations on B-Trees, Acta Informatica, Vol. 9, Fasc. 1, 1977, S. 1–22

    Article  Google Scholar 

  5. Foster: Information Storage and Retrieval using AVL-trees, Proc. ACM Nat. Conf. 20, 192–205, 1965

    Google Scholar 

  6. Karlton, Fuller, Scroggs, Kaehler: Performance of Height Balanced Trees, ACM, Jan. 1976, Vol. 19/1, S. 23–28

    Google Scholar 

  7. Mehlhorn, K.: Effiziente Algorithmen, Teubner Verlag, Studienbücher Informatik, 1977

    Google Scholar 

  8. Nievergelt, Reingold: Binary Search Trees of Bounded Balance, SIAM, J. Comput., Vol. 2, No. 1, March 1973

    Google Scholar 

  9. Ottman, Six: Eine neue Klasse von ausgeglichenen Bäumen, Angewandte Informatik, Heft 9, S. 395–400, 1976

    Google Scholar 

  10. Yao: On Random 2–3 Trees, Acta Informatica, Vol. 9, Fasc. 2, 1978, S. 159–170

    Article  Google Scholar 

  11. Knuth: The Art of Computer Programming, Vol. III: Sorting and Searching, Addison Wesley Publishing Company

    Google Scholar 

Download references

Authors
  1. Norbert Blum
    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

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blum, N., Mehlhorn, K. (1979). Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation