Pages that link to "Item:Q4670356"

The following pages link to Boltzmann Samplers for the Random Generation of Combinatorial Structures (Q4670356):

Displayed 50 items.

• Topological language for RNA (Q343072) ‎ (← 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)
• Asymptotics and random sampling for BCI and BCK lambda terms (Q391429) ‎ (← links)
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings (Q403161) ‎ (← links)
• Sampling different kinds of acyclic automata using Markov chains (Q442144) ‎ (← links)
• Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) ‎ (← links)
• Crossings and nestings for arc-coloured permutations and automation (Q490316) ‎ (← links)
• Fatgraph models of RNA structure (Q523931) ‎ (← links)
• An algorithm computing combinatorial specifications of permutation classes (Q526814) ‎ (← links)
• Weakly directed self-avoiding walks (Q640847) ‎ (← links)
• On properties of random dissections and triangulations (Q653837) ‎ (← links)
• Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) ‎ (← links)
• Controlled non-uniform random generation of decomposable structures (Q708203) ‎ (← links)
• Counting and generating permutations in regular classes (Q727971) ‎ (← links)
• Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) ‎ (← links)
• Shapes of topological RNA structures (Q899333) ‎ (← links)
• Families of prudent self-avoiding walks (Q965213) ‎ (← links)
• Enumeration and random generation of accessible automata (Q995562) ‎ (← links)
• Stacks in canonical RNA pseudoknot structures (Q1025221) ‎ (← links)
• The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) ‎ (← links)
• Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) ‎ (← links)
• Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method (Q1687781) ‎ (← links)
• Symmetries of unlabelled planar triangulations (Q1700803) ‎ (← links)
• Enumerating lambda terms by weighted length of their de Bruijn representation (Q1706116) ‎ (← 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)
• Synchronization of Bernoulli sequences on shared letters (Q2013553) ‎ (← links)
• Threshold functions for small subgraphs in simple graphs and multigraphs (Q2189830) ‎ (← links)
• Limits of random tree-like discrete structures (Q2192232) ‎ (← links)
• Universal limits of substitution-closed permutation classes (Q2216743) ‎ (← links)
• Counting phylogenetic networks of level 1 and 2 (Q2219260) ‎ (← links)
• Partitions into distinct parts with bounded largest part (Q2221681) ‎ (← links)
• Incremental delay enumeration: space and time (Q2274091) ‎ (← links)
• Statistical properties of lambda terms (Q2327214) ‎ (← links)
• On RNA-RNA interaction structures of fixed topological genus (Q2344602) ‎ (← links)
• Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) ‎ (← links)
• Generating labeled planar graphs uniformly at random (Q2373725) ‎ (← links)
• Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) ‎ (← links)
• Probabilistic divide-and-conquer: deterministic second half (Q2407388) ‎ (← links)
• A linear algorithm for the random sampling from regular languages (Q2428675) ‎ (← links)
• Generation of RNA pseudoknot structures with topological genus filtration (Q2437014) ‎ (← links)
• Enumeration and generation with a string automata representation (Q2465040) ‎ (← links)
• Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications (Q2795938) ‎ (← links)
• Boltzmann sampling of ordered structures (Q2840554) ‎ (← links)
• Vertices of Degree k in Random Unlabeled Trees (Q2851435) ‎ (← links)
• AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) ‎ (← links)
• Random Deterministic Automata (Q2921998) ‎ (← links)
• The maximum degree of random planar graphs (Q2930131) ‎ (← links)