Pages that link to "Item:Q1334654"
From MaRDI portal
The following pages link to A calculus for the random generation of labelled combinatorial structures (Q1334654):
Displayed 50 items.
- The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Combinatorial structures and structures for classification (Q1350822) (← links)
- A parallel algorithm for the generation of a permutation and applications (Q1351208) (← links)
- Uniform random generation of words of rational languages (Q1351211) (← links)
- Attribute grammars and automatic complexity analysis (Q1398296) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- Object grammars and bijections. (Q1401204) (← links)
- Patchworks and metablocks enumeration (Q1607027) (← links)
- Taming reluctant random walks in the positive quadrant (Q1687784) (← links)
- Extended boxed product and application to synchronized trees (Q1687792) (← links)
- Symmetries of unlabelled planar triangulations (Q1700803) (← links)
- Mallows and generalized Mallows model for matchings (Q1740522) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- Boltzmann samplers for first-order differential specifications (Q1759830) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- On the robustness of interconnections in random graphs: a symbolic approach. (Q1853495) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- From object grammars to ECO systems (Q1884915) (← links)
- Forbidden subgraphs in connected graphs (Q1884919) (← links)
- Random and uniform generation of words (Q1917516) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Counting phylogenetic networks of level 1 and 2 (Q2219260) (← links)
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models (Q2303740) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- Generating labeled planar graphs uniformly at random (Q2373725) (← links)
- Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) (← links)
- A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
- Generation of RNA pseudoknot structures with topological genus filtration (Q2437014) (← links)
- Non-uniform random generation of generalized Motzkin paths (Q2491216) (← links)
- Efficient iteration in admissible combinatorial classes (Q2581353) (← links)
- On computing the coefficients of bivariate holonomic formal series (Q2581355) (← links)
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study (Q2665758) (← links)
- Young tableaux with periodic walls: counting with the density method (Q2680926) (← links)
- (Q2741466) (← links)
- A generic approach for the unranking of labeled combinatorial classes (Q2772928) (← links)
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications (Q2795938) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
- Random Deterministic Automata (Q2921998) (← links)
- Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (Q2947417) (← links)
- Uniform random sampling of planar graphs in linear time (Q3055787) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- Probabilistic models for pattern statistics (Q3431436) (← links)
- Iterating Through Labelled Combinatorial Structures (Q3438983) (← links)
- Average Value and Variance of Pattern Statistics in Rational Models (Q3503895) (← links)
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP (Q3520365) (← links)