The relevant prefixes of coloured Motzkin walks: An average case analysis
Authors:
- D. MerliniDMD. Merlini
- R. SprugnoliRSR. Sprugnoli
- 1 January 2010
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (1) , 148-163
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Non uniform random generation of generalized Motzkin pathsActa Informatica, 2006
- Boltzmann Samplers for the Random Generation of Combinatorial StructuresCombinatorics, Probability and Computing, 2004
- A bijection between ordered trees and 2-Motzkin paths and its many consequencesDiscrete Mathematics, 2002
- A generic approach for the unranking of labeled combinatorial classesRandom Structures & Algorithms, 2001
- Random generation of trees and other combinatorial objectsTheoretical Computer Science, 1999
- Generating words lexicographically: An average-case analysisActa Informatica, 1998
- The random generation of underdiagonal walksDiscrete Mathematics, 1995
- Uniform generation of a Motzkin wordTheoretical Computer Science, 1994
- A calculus for the random generation of labelled combinatorial structuresTheoretical Computer Science, 1994
- Motzkin numbersJournal of Combinatorial Theory, Series A, 1977