Uniform random generation of decomposable structures using floating-point arithmetic
From MaRDI portal
Publication:1292294
DOI10.1016/S0304-3975(98)00323-5zbMATH Open0933.68154OpenAlexW2043046702MaRDI QIDQ1292294FDOQ1292294
Authors: Alain Denise, Paul Zimmermann 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00323-5
Recommendations
Cites Work
- Title not available (Why is that?)
- GFUN
- A method and two algorithms on the theory of partitions
- Uniform generation of a Motzkin word
- A linear-time algorithm for the generation of trees
- Title not available (Why is that?)
- A calculus for the random generation of labelled combinatorial structures
- Title not available (Why is that?)
- Uniform Random Generation of Strings in a Context-Free Language
- Random generation of words in an algebraic language in linear binary space
- Uniform random generation of words of rational languages
- Generating words in a context-free language uniformly at random
Cited In (22)
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- Non-redundant random generation algorithms for weighted context-free grammars
- Faster FPTASes for counting and random generation of knapsack solutions
- Controlled non-uniform random generation of decomposable structures
- Uniform generation in trace monoids
- Probabilistic divide-and-conquer: deterministic second half
- Generating labeled planar graphs uniformly at random
- On the lexicographical generation of compressed codes
- Holonomic equations and efficient random generation of binary trees
- Counting and generating permutations in regular classes
- Exact-Size Sampling of Enriched Trees in Linear Time
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- A random testing approach using pushdown automata
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
- Random Generation for Finitely Ambiguous Context-free Languages
- Uniform random sampling of planar graphs in linear time
- Parametric random generation of deterministic tree automata
- Enumeration and random generation of accessible automata
- A linear algorithm for the random sampling from regular languages
- Random deterministic automata
- Formulae and asymptotics for coefficients of algebraic functions
Uses Software
This page was built for publication: Uniform random generation of decomposable structures using floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292294)
