See this document in CiteSeerX!

Stochastic Analysis Of Tree-Like Data Structures (2002)  (Make Corrections)  (1 citation)
Michael Drmota



  Home/Search   Context   Related

 
View or download:
geometrie.tuwien.ac.at...stochana.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  geometrie.tuwien.ac.at/drmota/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The purpose of this article is to present two types of data structures, binary search trees and usual (combinatorial) binary trees. Although they constitute the same set of (rooted) trees they are constructed via completely di erent rules and thus the underlying probabilitic models are di erent, too. Both kinds of data structures can be analyzed by probabilistic and stochastic tools, binary search trees (more or less) with martingales and binary trees (which can be considered as a special case... (Update)

Cited by:   More
The Width of Galton-Watson Trees Conditioned by the Size - Drmota, Gittenberger (2004)   (Correct)

Active bibliography (related documents):   More   All
3.1:   Profile and Height of Random Binary Search Trees - Drmota (2003)   (Correct)
2.2:   Analysis of Algorithms (AofA): Part II: 1998 - 2000.. - Drmota, Szpankowski (2003)   (Correct)
1.3:   An Analytic Approach To The Height Of Binary Search Trees II - Drmota (2000)   (Correct)

Similar documents based on text:   More   All
0.1:   The Distribution of Patterns in Digital Expansions - Drmota (2000)   (Correct)
0.1:   The Variance Of The Height Of Digital Search Trees - Drmota (2000)   (Correct)
0.1:   The Saturation Level in Binary Search Tree - Drmota   (Correct)

BibTeX entry:   (Update)

M. Drmota, Stochastic analysis of tree-like data structures, Proc. R. Soc. Lond. A 460 (2004), 271-307. http://citeseer.ist.psu.edu/drmota02stochastic.html   More

@misc{ drmota04stochastic,
  author = "M. Drmota",
  title = "Stochastic analysis of tree-like data structures",
  text = "M. Drmota, Stochastic analysis of tree-like data structures, Proc. R. Soc.
    Lond. A 460 (2004), 271-307.",
  year = "2004",
  url = "citeseer.ist.psu.edu/drmota02stochastic.html" }
Citations (may not include all citations):
2003   The Art of Computer Programming (context) - Knuth - 1998
602   Convergence of Probability Measures (context) - Billingsley - 1968
466   Probability and Measure (context) - Billingsley - 1995
151   Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990
130   Evolution of Random Search Trees (context) - Mahmoud - 1992
97   Computer Journal (context) - Hoare - 1962
66   the altitude of nodes in random trees (context) - Meir, Moon - 1978
51   The continuum random tree III (context) - Aldous - 1993
42   A note on the height of binary search trees (context) - Devroye - 1986
42   The continuum random tree II: an overview (context) - Aldous - 1991
35   The continuum random tree (context) - Aldous - 1991
23   Branching processes in the analysis of the height of trees (context) - Devroye - 1987
23   On growing random binary trees (context) - Pittel - 1984
21   Some properties of a limiting distribution of Quicksort (context) - Tan, Hadjicostas - 1995
20   The average height of binary trees and other simple trees (context) - Flajolet, Odlyzko - 1982
18   The SDE solved by local times of a Brownian excursion or bri.. - Pitman - 1999
17   An analytic approach to the height of binary search trees II - Drmota
17   An analytic approach to the height of binary search trees - Drmota - 2001
16   A bivariate asymptotic expansion of coecients of powers of g.. (context) - Drmota - 1994
16   The height of binary search trees (context) - Robson - 1979
15   Quicksort asymptotics - Fill, Janson
15   the variance of the height of random binary search trees (context) - Devroye, Reed - 1995
15   Excursions of Brownian motion and Bessel processes (context) - Getoor, Sharpe - 1979
15   Quicksort algorithms again revisited - Knessl, Szpankowski - 1999
13   Smoothness and decay properties of the limiting Quicksort de.. - Fill, Janson - 2000
12   The height distribution of leaves in rooted trees (context) - Drmota - 1994
11   the contour of random trees - Gittenberger - 1999
10   The variance of the height of binary search trees - Drmota - 2002
10   The contraction method for recursive algorithms (context) - osler, uschendorf - 2001
10   An approximation of partial sums of independent RV's and the.. (context) - Komlos, Major et al. - 1976
10   Levy's local time and Brownian excursion (context) - Louchard, formula - 1984
10   The height of a random binary search tree (context) - Reed
9   Approximating the limiting Quicksort distribution - Fill, Janson - 2001
9   the explicit form of the density of Brownian excursion local.. (context) - Hooghiemstra - 1982
8   Brownian local times (context) - Tak - 1995
8   Constant bounds on the moments of the height of binary searc.. (context) - Robson
8   Algorithm 64: Quicksort (context) - Hoare - 1961
8   The Galton-Watson process conditioned on the total progeny (context) - Kennedy - 1975
7   a temps discret (context) - Neveu - 1972
7   the concentration of the height of binary search trees (context) - Robson - 1997
7   the pro le of random trees (context) - Drmota, Gittenberger - 1997
6   and the width of rooted labeled trees (context) - Marckert, Chassaing et al. - 2001
6   Mathematics of Operations Research (context) - Cohen, Hooghiemstra et al. - 1981
5   More combinatorial problems on certain trees (context) - Lynch - 1965
5   eorique ApplicationTheoretical Informatic and Application (context) - theorem, Informatique et al. - 1991
5   The width of Galton-Watson trees - Drmota, Gittenberger
5   eorique ApplicationTheoretical Informatic and Application (context) - distribution, Informatique et al. - 1989
4   Asymptotic development of the Stirling numbers of the rst ki.. (context) - Moser, Wyman - 1958
3   The asymptotic distribution of the total heights of random r.. (context) - Tak - 1993
3   Reinforced weak convergence of stochastic processes - Drmota, Marckert
3   Martingales and large deviations for binary search trees (context) - Jabbour-Hattab - 2001
2   Unsolved Problems (context) - Ponder - 1986
2   The convergence of solutions of the Kolmogorov nonlinear di .. (context) - Bramson - 1983
2   the height pro le of a conditioned Galton-Watson tree (context) - Kersting - 1998
2   The pro le of binary search trees (context) - Chauvin, Drmota et al. - 2001
2   Bandwiths and pro les of trees (context) - Odlyzko, Wilf - 1987
1   Limit theorems for the minimal position in a branching rando.. (context) - Bachmann - 2000
1   and exact nontrivial exponents in a random fragmentation pro.. (context) - Krapivsky, Majumdar et al. - 2002

Documents on the same site (http://www.geometrie.tuwien.ac.at/drmota/):   More
The Asymptotic Number of Leftist Trees - Drmota (2000)   (Correct)
An Analytic Approach To The Height Of Binary Search Trees - Drmota (2000)   (Correct)
The Joint Distribution Of q-Additive Functions - Drmota   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC