Pages that link to "Item:Q1292294"

The following pages link to Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294):

Displaying 21 items.

• A new dichotomic algorithm for the uniform random generation of words in regular languages (Q391418) (← links)
• Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
• Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
• Counting and generating permutations in regular classes (Q727971) (← links)
• Enumeration and random generation of accessible automata (Q995562) (← links)
• Parametric random generation of deterministic tree automata (Q1959655) (← links)
• Generating labeled planar graphs uniformly at random (Q2373725) (← links)
• On the lexicographical generation of compressed codes (Q2380004) (← links)
• Probabilistic divide-and-conquer: deterministic second half (Q2407388) (← links)
• Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
• A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
• Random Deterministic Automata (Q2921998) (← links)
• Uniform Generation in Trace Monoids (Q2946325) (← links)
• A Random Testing Approach Using Pushdown Automata (Q3012968) (← links)
• Uniform random sampling of planar graphs in linear time (Q3055787) (← links)
• Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
• RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP (Q3520365) (← links)
• Formulae and Asymptotics for Coefficients of Algebraic Functions (Q5364226) (← links)
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (Q5366902) (← links)
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
• Exact-Size Sampling of Enriched Trees in Linear Time (Q6057780) (← links)