Holonomic equations and efficient random generation of binary trees
From MaRDI portal
Recommendations
Cites work
- A calculus for the random generation of labelled combinatorial structures
- A classic proof of a recurrence for a very classical sequence
- A geometric bijection between a family of hypermaps and a family of polygons enumerated by the series of Schröder
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- From Motzkin to Catalan permutations
- GFUN
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- Interprétation bijective d'une récurrence des nombres de Motzkin. (Bijective interpretation of a recurrence of Motzkin numbers)
- Motzkin numbers
- Non-uniform random generation of generalized Motzkin paths
- On the enumeration of closures and environments with an application to random generation
- Polynomial tuning of multiparametric combinatorial samplers
- Random generation using binomial approximations
- Simulating size-constrained Galton-Watson trees
- Uniform generation of a Motzkin word
- Uniform generation of a Schröder tree
- Uniform random generation of decomposable structures using floating-point arithmetic
This page was built for publication: Holonomic equations and efficient random generation of binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599803)