Asymptotic properties of some underdiagonal walks generation algorithms

Theoretical Computer Science

Volumn 218, Issue 2, 1999, Pages 249-262

  Louchard, G ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009777127     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00324-7     Document Type: Article

References (12)

1. D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, Springer, New York, 1989.
2. E. Barcucci, R. Pinzani, R. Sprugnoli, Génération aléatoire des animaux dirigés, in: J. Labelle, J.-G. Penaud (Eds.), Actes de l'Atelier Franco-Québecois de Combinatoire, Publications du LACIM, vol. 10, 1992, pp. 17-25 (an upgraded English version will appear in Theoret. Comput. Sci.).
3. E. Barcucci, R. Pinzani, R. Sprugnoli, The random generation of underdiagonal walks, Discrete Math. 139 (1995) 3-18.
4. P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
5. K.L. Chung, Excursions in Brownian motion, Ark. Mat. 14 (1976) 155-177.
6. W. Feller, Introduction to Probability Theory and its Applications, vol. II, Wiley, New York, 1970.
7. K. Ito, H.P. Mckean jr, Diffusion Processes and their Sample Paths, 2nd ed., Springer, Berlin, 1974.
8. G. Louchard, Kac's formula, Levy's local time and Brownian excursion, J. Appl. Probab. 21 (1984) 479-499.
9. G. Louchard, Some distributed algorithms revisited, Stochastic Models 11 (4) (1995) 563-586.
10. G. Louchard, R. Schott, Probabilistic analysis of some distributed algorithms, Random Struct. Algorithms 2 (2) (1991) 151-186.
11. G. Louchard, W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Trans. Inform. Theor. 41 (1995) 478-488.
12. F. Spitzer, Principles of Random Walk, D. Van Nostrand Company, New York, 1964.