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):
Displaying 50 items.
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Enumerative encoding of correlation-immune Boolean functions (Q386997) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Boltzmann samplers for \(v\)-balanced cycles (Q391394) (← links)
- 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)
- Sampling different kinds of acyclic automata using Markov chains (Q442144) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Random generation of words in an algebraic language in linear binary space (Q673672) (← links)
- A linear-time algorithm for the generation of trees (Q675311) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- Simulating the component counts of combinatorial structures (Q725139) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- A framework for generating some discrete sets with disjoint components by using uniform distributions (Q952451) (← links)
- Families of prudent self-avoiding walks (Q965213) (← links)
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets (Q967404) (← links)
- Enumeration and random generation of accessible automata (Q995562) (← links)
- Classifying lattice walks restricted to the quarter plane (Q1003654) (← links)
- The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← 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)
- Random generation of combinatorial structures -- GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 -- June 4, 2016. (Q1682318) (← 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)
