The random generation of directed animals
From MaRDI portal
Publication:1342241
DOI10.1016/0304-3975(94)90046-9zbMATH Open0938.68935OpenAlexW2061847193MaRDI QIDQ1342241FDOQ1342241
R. Pinzani, Renzo Sprugnoli, Elena Barcucci
Publication date: 9 February 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90046-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Motzkin numbers
- On context-free languages and push-down automata
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Animaux et arbres guingois. (Animals and guingois trees)
- Binary search networks: A new method for key searching
Cited In (12)
- A parallel algorithm for the generation of a permutation and applications
- Random and uniform generation of words
- Generating random binary trees -- a survey
- Riordan arrays and combinatorial sums
- Title not available (Why is that?)
- ``Deco polyominoes, permutations and random generation
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution
- Basic analytic combinatorics of directed lattice paths
- Schröder's paths and random hierarchies
- Non-uniform random generation of generalized Motzkin paths
- Uniform generation of a Motzkin word
- Exhaustive generation of some lattice paths and their prefixes
This page was built for publication: The random generation of directed animals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342241)
