Skip to main content
SpringerLink
Log in

Über Einige Funktionaldifferentialgleichungen Aus Der Analyse Von Algorithmen

  • Chapter
  • First Online:
Zahlentheoretische Analysis II

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

  • 403 Accesses

Abstract

In the analysis of algorithms the study of moment generating functions often leads to functional differential equations. In this paper a number of different cases are treated in a unique framework which allows to establish explicit formulae as well as the asymptotic behaviour of the (factorial) moments.

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

Access this chapter

Log in via an institution
eBook
USD 19.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.95
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. DE BRUIJN N.G., Asymptotic methods in analysis, Dover, New York 1981.

    MATH  Google Scholar 

  2. DOBERKAT E.E., Asymptotic estimates for the higher moments of the expected behaviour of straight insertion sort, Informat. Process.Letters 14 (1982), 179–182.

    Article  MathSciNet  MATH  Google Scholar 

  3. FELLER W., An Introduction to Probability Theory, Vol. II, Wiley, New York 1971.

    MATH  Google Scholar 

  4. GREENE D.H. und D.E. KNUTH, Mathematics for the analysis of algorithms, Birkhäuser, Boston 1982.

    MATH  Google Scholar 

  5. KEMP R., Fundamentals of the average case analysis of particular algorithms, Wiley-Teubner, Stuttgart 1984.

    Book  MATH  Google Scholar 

  6. KIRSCHENHOFER P., H.PRODINGER und R.F.TICHY, A contribution to the analysis of in situ permutation, preprint, TU Wien (1985).

    Google Scholar 

  7. KNUTH D.E., The art of computer programming, Vol. I, Addison Wesley 1969.

    Google Scholar 

  8. KNUTH D.E., The art of computer programming, Vol. III, Addison Wesley 1973.

    Google Scholar 

  9. KNUTH D.E., Mathematical analysis of algorithms, in: Information Processing 71, 19–27, North Holland 1972.

    Google Scholar 

  10. MAC LEOD L.D.G., An algorithm for in-situ permutation, Austral. Comput.J.2 (1970), 16–19.

    Google Scholar 

  11. PANNY W., A note on the higher moments of the expected behaviour of straight insertion sort, Inform.Process.Letters 22(1986), 175–178.

    Article  MathSciNet  MATH  Google Scholar 

  12. PRODINGER H., Eine Bemerkung zum asymptotischen Verhalten der höheren Momente der Anzahl der Inversionen, Anz. Österr.Akad. Wiss.Math.Nat.Kl.121(1984), 141–143.

    MathSciNet  Google Scholar 

  13. SEDGEWICK R., Mathematical Analysis of Combinatorial Algorithms, in: Probability Theory and Computer Science (G. Louchard, G. Latouche eds.), 123–206, Academic Press, London 1983.

    Google Scholar 

  14. ZAVE D.A., A series expansion involving the harmonic numbers, Inform.Process.Letters 5(1976), 75–77.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst.f.Algebra u.Diskrete Mathematik der Technischen Universität Wien, Wiedner Hauptstr.8-10, 1040, Wien

    Peter Kirschenhofer & Helmut Prodinger

  2. Inst.f.Analysis, Techn.Mathem. u. Versicherungsmathematik der Technischen Universität Wien, Wiedner Hauptstr.8-10, 1040, Wien

    Robert F. Tichy

Authors
  1. Peter Kirschenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert F. Tichy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Hlawka

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag

About this chapter

Cite this chapter

Kirschenhofer, P., Prodinger, H., Tichy, R.F. (1987). Über Einige Funktionaldifferentialgleichungen Aus Der Analyse Von Algorithmen. In: Hlawka, E. (eds) Zahlentheoretische Analysis II. Lecture Notes in Mathematics, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0078600

Download citation

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

  • 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

Publish with us

Policies and ethics

Search

Navigation