Pages that link to "Item:Q1341731"

The following pages link to Uniform generation of a Motzkin word (Q1341731):

Displaying 16 items.

• Uniform generation of a Schröder tree (Q293156) (← links)
• Relative locations of subwords in free operated semigroups and Motzkin words. (Q493381) (← 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)
• Operated semigroups, Motzkin paths and rooted trees (Q1016141) (← links)
• The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
• Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
• A parallel algorithm for the generation of a permutation and applications (Q1351208) (← links)
• Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method (Q1687781) (← links)
• Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) (← links)
• Probabilistic divide-and-conquer: deterministic second half (Q2407388) (← links)
• Non-uniform random generation of generalized Motzkin paths (Q2491216) (← links)
• On the reconstruction of a Motzkin Tree from its code (Q4469167) (← links)
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (Q5366902) (← links)
• Schröder's paths and random hierarchies (Q5941076) (← links)
• Holonomic equations and efficient random generation of binary trees (Q6599803) (← links)