Pages that link to "Item:Q2491216"

The following pages link to Non-uniform random generation of generalized Motzkin paths (Q2491216):

Displaying 13 items.

• Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
• The height of two types of generalised Motzkin paths (Q393631) (← links)
• A bijective approach to the area of generalized Motzkin paths (Q696823) (← links)
• Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
• The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
• Uniform generation of a Motzkin word (Q1341731) (← links)
• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
• Exhaustive generation of some lattice paths and their prefixes (Q2043010) (← links)
• On the generating functions of pattern-avoiding Motzkin paths (Q2133921) (← links)
• Area-width scaling in generalised Motzkin paths (Q2147673) (← links)
• A half-normal distribution scheme for generating functions and the unexpected behavior of Motzkin paths (Q4632501) (← links)
• ECO method and hill-free generalized Motzkin paths (Q5947962) (← links)
• Holonomic equations and efficient random generation of binary trees (Q6599803) (← links)