Asymptotic properties of some underdiagonal walks generation algorithms
From MaRDI portal
Publication:1292295
DOI10.1016/S0304-3975(98)00324-7zbMath0933.68153MaRDI QIDQ1292295
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution ⋮ Energy-constrained random walk with boundary replenishment ⋮ Basic analytic combinatorics of directed lattice paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability approximations via the Poisson clumping heuristic
- Excursions in Brownian motion
- The random generation of underdiagonal walks
- Kac's formula, levy's local time and brownian excursion
- Probabilistic analysis of some distributed algorithms
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Some distributed algorithms revisited
This page was built for publication: Asymptotic properties of some underdiagonal walks generation algorithms
