Asymptotic properties of some underdiagonal walks generation algorithms

DOI10.1016/S0304-3975(98)00324-7zbMATH Open0933.68153MaRDI QIDQ1292295FDOQ1292295

Guy Louchard

Publication date: 21 June 1999

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

Recommendations

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

zbMATH Keywords

random walks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Probability approximations via the Poisson clumping heuristic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kac's formula, levy's local time and brownian excursion
• Excursions in Brownian motion
• The random generation of underdiagonal walks
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
• Some distributed algorithms revisited
• Probabilistic analysis of some distributed algorithms

Cited In (5)

• Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution
• Energy-constrained random walk with boundary replenishment
• Basic analytic combinatorics of directed lattice paths
• Title not available (Why is that?)
• The random generation of underdiagonal walks

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)