Asymptotic properties of some underdiagonal walks generation algorithms

DOI10.1016/S0304-3975(98)00324-7MaRDI QIDQ1292295zbMATH OpenFDO

Authors Guy Louchard

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

random walks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• The random generation of underdiagonal walks
• scientific article; zbMATH DE number 1552344
• Bounded discrete walks
• scientific article; zbMATH DE number 1984534

Cites work

• scientific article; zbMATH DE number 3447884 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
• Excursions in Brownian motion
• Kac's formula, levy's local time and brownian excursion
• Probabilistic analysis of some distributed algorithms
• Probability approximations via the Poisson clumping heuristic
• Some distributed algorithms revisited
• The random generation of underdiagonal walks

Cited in

(5)

• The random generation of underdiagonal walks
• Energy-constrained random walk with boundary replenishment
• Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution
• Basic analytic combinatorics of directed lattice paths
• scientific article; zbMATH DE number 1552344 (Why is no real title available?)

This page was built for publication: Asymptotic properties of some underdiagonal walks generation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292295)