Asymptotic properties of some underdiagonal walks generation algorithms

Authors:
G. Louchard
Affiliations:
Univ. Libre de Bruxelles, Brussels, Belgium
Venue:
Theoretical Computer Science - Special issue on Caen '97
Year:
1999

Citing 0
Cited 3

Basic analytic combinatorics of directed lattice paths

Theoretical Computer Science
Random Sampling from Boltzmann Principles

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Boltzmann Samplers for the Random Generation of Combinatorial Structures

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract