Schröder's paths and random hierarchies

DOI10.1016/S0304-3975(99)00293-5zbMath0974.68233OpenAlexW2086987876MaRDI QIDQ5941076

Elisa Pergola, Olivier Roques, Renzo Pinzani, Jean-Guy Penaud

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00293-5

zbMATH Keywords

classificationrandom generation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution ⋮ Non-uniform random generation of generalized Motzkin paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform generation of a Schröder tree
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• A calculus for the random generation of labelled combinatorial structures
• Uniform generation of a Motzkin word
• The random generation of directed animals
• A classic proof of a recurrence for a very classical sequence
• Random and uniform generation of words
• A problem of arrangements
• Deux propriétés combinatoires des nombres de Schröder
• Hipparchus, Plutarch, Schroder, and Hough

This page was built for publication: Schröder's paths and random hierarchies