A calculus for the random generation of labelled combinatorial structures
- 1 September 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 132 (1-2) , 1-35
- https://doi.org/10.1016/0304-3975(94)90226-7
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Automatic average-case analysis of algorithmsTheoretical Computer Science, 1991
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- Solution of a Divide-and-Conquer Maximin RecurrenceSIAM Journal on Computing, 1989
- A recurrence related to treesProceedings of the American Mathematical Society, 1989
- On a Recurrence involving Stirling NumbersEuropean Journal of Combinatorics, 1984
- Uniform Random Generation of Strings in a Context-Free LanguageSIAM Journal on Computing, 1983
- Random mappings with constraints on coalescence and number of originsPacific Journal of Mathematics, 1982
- Une théorie combinatoire des séries formellesAdvances in Mathematics, 1981
- The expected linearity of a simple equivalence algorithmTheoretical Computer Science, 1978
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978