Binomial random variate generation
Communications of the ACM
Algorithm 678: BTPEC: sampling from the binomial distribution
ACM Transactions on Mathematical Software (TOMS)
The ratio of uniforms approach for generating discrete random variates
Journal of Computational and Applied Mathematics - Random numbers and simulation
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
The random generation of directed animals
Theoretical Computer Science
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Survey of Combinatorial Gray Codes
SIAM Review
Uniform generation of a Schro¨der tree
Information Processing Letters
Random generation of trees and other combinatorial objects
Theoretical Computer Science - Special issue on Caen '97
Generating sums in constant average time
WSC '88 Proceedings of the 20th conference on Winter simulation
Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Generating functions for generating trees
Discrete Mathematics
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
Building uniformly random subtrees
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Generating random binary trees - A survey
Information Sciences: an International Journal
| Hi-index | 0.00 |
We discuss various methods for generating random Galton-Watson trees conditional on their sizes being equal to $n$. A linear expected time algorithm is proposed.