Abstract
The Brownian motion is shown to be a useful tool in analysing some sorting and tree manipulation algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Billingsley,Convergence of Probability Measures, 1968, Wiley.
L. Chottin et R. Cori,Une preuve combinatoire de la rationalité d'une série génératrice associée aux arbres, RAIRO, Inf. Th. 16, 2, 1982, 113–128.
K. L. Chung,Excursions in Brownian Motion, Ark. Mat., 14, 1976, 155–177.
M. Csörgö and P. Révész,Strong Approximations in Probability and Statistics, 1981, Academic Press.
L. Devroye,A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Inf. 21, 1984, 229–237.
P. Flajolet and L. Ramshaw,A note on Gray code and odd-even merge, SIAM J. Comput. 9, 1, 1980, 142–158.
P. Flajolet,Combinatorial aspects of continued fractions, Discr. Math. 32, 1980, 125–161.
P. Fjalolet,Analyse d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du BURO, 1981.
P. Flajolet and A. Odlyzko,The average height of binary trees and other simple trees, J. Comp. Syst. Sc. 25, 2, 1982, 171–213.
P. Flajolet and J. M. Steyaert,A branching process arising in dynamic hashing, trie searching and polynomial factorization, 9th Int. Coll., Aut. Lang. Prog. Aarhus 1982. Lecture notes in Comp. Sc. 140, 239–251.
P. Flajolet,On the performance evaluation of extendible hashing and trie searching, Acta Inf. 20, 1983, 345–369.
P. Flajolet, C. Puech and J. Vuillemin,The analysis of simple list structures, to appear in Information Sc.: an Int. J.
P. Flajolet and H. Prodinger,Register allocation for unary-binary trees, to appear in SIAM J. Comput.
J. Françon,Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique, RAIRO, Inf. Th. 18, 4, 1984, 355–364.
K. Ito and H. P. Mc Kean Jr.,Diffusion Processes and their Sample Paths, 2nd ed., 1976, Springer-Verlag.
M. Kac,On deviations between theoretical and empirical distributions, Proc. Nat. Ac. Sci., 35, 5, 1949, 252–257.
W.D. Kaigh,An invariance principle for random walk conditioned by a late return to zero, Ann. Prob. 4, 1, 1976, 115–121.
F.B. Knight,On the excursion process of Brownian motion, Trans. Amer. Math. Soc. 588, 1, 1980, 77–86.
D. E. Knuth,The Art of Computer Programming, Vol. I, 1969, Addison-Wesley.
D.E. Knuth,The Art of Computer Programming, Vol. III, 1973, Addison-Wesley.
P. Levy,Processes Stochastiques et Mouvement Brownien, Chapitre VI, 1948, Gauthier-Villars.
G. Louchard,The Brownian motion: a neglected tool for the complexity analysis of sorted tables manipulation, RAIRO, Inf. Th. 17, 4, 1983, 365–385.
G. Louchard,Kac's formula, Levy's local time and Brownian excursion, J. Appl. Prob. 21, 1984, 479–499.
G. Louchard,The Brownian excursion area: a numerical analysis, Comp. and Math. with Appl., 10, 6, 1984, 413–417.
G. Louchard,A note on some Brownian Meander local time, L.I.T. Techn. Rep. (in preparation).
H. P. Mc Kean Jr.,Stochastic Integrals, 1969, Academic Press.
M. Reignier,Evaluation des performances du hachage dynamique, Thèse de doctorat, Univ. Paris-Sud, 1983.
A. Renyi and G. Szekeres,On the height of trees, Austr. J. of Math. 7, 1967, 497–506.
R. Sedgewick,Data movement in odd-even merging, SIAM J. Comput. 7, 1978, 239–272.
R. Sedgewick,Mathematical analysis of combinatorial algorithms inProbability and Computer Science, G. Latouche and G. Louchard, eds., 1983, Academic Press.
L. A. Shepp,On the integral of the absolute value of the pinned Wiener process, Ann. Prob. 10, 1, 1982, 234–239.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Louchard, G. Brownian motion and algorithm complexity. BIT 26, 17–34 (1986). https://doi.org/10.1007/BF01939359
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01939359