Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
From MaRDI portal
Recommendations
Cites work
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Analytic combinatorics
- Attribute grammars and automatic complexity analysis
- Automatic average-case analysis of algorithms
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Boltzmann sampling of unlabelled structures
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- Une approche combinatoire pour l'itération de Newton-Raphson
Cited in
(8)- Random generation of combinatorial structures from a uniform distribution
- Random generation of combinatorial structures -- GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 -- June 4, 2016.
- scientific article; zbMATH DE number 2127754 (Why is no real title available?)
- Enumeration, Counting, and Random Generation of Ladder Lotteries
- Analysis of Recursive Probabilistic Models
- scientific article; zbMATH DE number 1303203 (Why is no real title available?)
- Enumeration and randomized constructions of hypertrees
- Recursively defined combinatorial functions: Extending Galton's board
This page was built for publication: Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304095)