Skip to main content
SpringerLink
Log in

Random walks, gaussian processes and list structures

  • Probability On Trees
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

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

Included in the following conference series:

Abstract

An asymptotic analysis of list structures properties leads to limiting Gaussian Markovian processes. Several costs functions are shown to have asymptotic Normal distributions.

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. ABRAMOWITZ, M. and STEGUE, I.A. "Handbook of mathematical functions", 1965, Dover Publications

    Google Scholar 

  2. BILLINGSLEY, P. "Convergence of probability measures", 1968, Wiley

    Google Scholar 

  3. CHUNG, K.L. "Excursions in Brownian Motion", Ark. Mat. 14, 1976, pp. 155–177

    Google Scholar 

  4. FELLER, W. "An introduction to probability theory and its applications", Vol.I, 1970, Wiley

    Google Scholar 

  5. FELLER, W. "An introduction to probability theory and its applications", Vol.II, 1971, Wiley

    Google Scholar 

  6. FLAJOLET, P. "Combinatorial aspects of continued fractions", Discr. Math. 32, 1980, pp. 125–161

    Google Scholar 

  7. FLAJOLET, P. "Analyse d'algorithmes de manipulation d'arbres et de fichiers", Cahiers du BURO, 1981

    Google Scholar 

  8. FLAJOLET, P. and ODLYZKO, A. "The average height of binary trees and other simple trees", J. Comp. Syst. Sc. 25, 2, 1982, pp. 171–213.

    Google Scholar 

  9. FLAJOLET, P., PUECH, C. and VUILLEMIN, J. "The analysis of simple list structures", to appear in Information Sc.: and Int. J.

    Google Scholar 

  10. FLAJOLET, P. and PRODINGER, H. "Register allocation for unary-binary trees", to appear in SIAM J. Comput.

    Google Scholar 

  11. GREENE, D.H. and KNUTH, D.E. "Hathematics for the analysis of algorithms", 1981, Birkhaüser

    Google Scholar 

  12. ITO, K. and Mc KEAN, H.P. Jr "Diffusion processes and their sample paths", Sec. Ed., 1976, Springer-Verlag

    Google Scholar 

  13. LOUCHARD, D., "The Brownian Motion: a neglected tool for the complexity analysis of sorted tables manipulations", RAIRO, Inf. Th. 17, 4, 1983, pp. 365–385

    Google Scholar 

  14. LOUCHARD, G. "Kac's formula, Levy's local time and Brownian excursion", J. Appl. Prob. 21, 1984, pp. 479–499.

    Google Scholar 

  15. LOUCHARD, G. "The Brownian excursion area: a numerical analysis", Comp. and Math. with Appl. 10, 6, 1984, pp. 413–417

    Google Scholar 

  16. LOUCHARD, G. "Brownian Motion and Algorithms Complexity", to appear in B.I.T.

    Google Scholar 

  17. LOUCHARD, G. "Random Walks, Gaussian Processes and List Structures", L.I.T. Technical Report No152

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique, Université Libre de Bruxelles, CP 212 Boulevard du Triomphe, 1050, Brussels, Belgium

    G. Louchard

Authors
  1. G. Louchard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Louchard, G. (1986). Random walks, gaussian processes and list structures. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022670

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation