Skip to main content

Asymptotische Untersuchungen Über Charakteristische Parameter Von SuchbĂumen

Part of the Lecture Notes in Mathematics book series (LNM,volume 1262)

Abstract

In Computer Science there are several algorithms which build search trees using digital properties of the search keys. An important parameter in the analysis of these data structures is the so-called pathlength. The average case analysis involves interesting mathematical methods from the calculus of finite differences and from asymptotic analysis. Some of the appearing constants may be evaluated using properties of modular functions.

This is a preview of subscription content, access via your institution.

Buying options

eBook
USD   19.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   29.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. APOSTOL T.M., Modular Functions and Dirichlet Series in Number Theory, Springer, New York 1976.

    CrossRef  MATH  Google Scholar 

  2. FLAJOLET Ph.und R.SEDGEWICK, Digital Search Trees Revisited, SIAM J.Comput., im Druck.

    Google Scholar 

  3. KIRSCHENHOFER P.und H. PRODINGER, Some Further Results on Digital Search Trees, in: Automata, Languages and Programming (L. Kott ed.), Lecture Notes in Computer Science 226, 177–185, Springer, Berlin 1986.

    CrossRef  Google Scholar 

  4. KNUTH D.E., The Art of Computer Programming Vol.3: Sorting and Searching, Addison-Wesley, Reading Mass. 1973.

    MATH  Google Scholar 

  5. MEHLHORN K., Data Structures and Algorithms Vol. 1, Springer, Berlin 1984.

    CrossRef  MATH  Google Scholar 

  6. NÖRLUND N.E., Vorlesungen über Differenzenrechnung, Chelsea, New York 1954.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1987 Springer-Verlag

About this chapter

Cite this chapter

Kirschenhofer, P., Prodinger, H. (1987). Asymptotische Untersuchungen Über Charakteristische Parameter Von SuchbĂumen. In: Hlawka, E. (eds) Zahlentheoretische Analysis II. Lecture Notes in Mathematics, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0078598

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47256-8

  • eBook Packages: Springer Book Archive