Olivier Roques

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Chemins de Schröder et hiérarchies aléatoires 2001 Jean-Guy Penaud
Elisa Pergola
Renzo Pinzani
Olivier Roques
3
+ Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem 1988 Dominique Gouyou-Beauchamps
GĂ©rard Viennot
2
+ Uniform generation of a Motzkin word 1994 Laurent Alonso
2
+ Génération de chemins de Dyck à pics croissants 2002 Jean-Guy Penaud
Olivier Roques
2
+ A Bijective Approach to the Area of Generalized Motzkin Paths 2002 Elisa Pergola
Renzo Pinzani
Simone Rinaldi
Robert A. Sulanke
1
+ A Source Book in Mathematics, 1200-1800. 1970 Judith V. Grabiner
D. J. Struik
1
+ Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules 1956 H. N. V. Temperley
1
+ Generating Random Unlabelled Graphs 1987 Nicholas Wormald
1
+ Hipparchus, Plutarch, Schröder, and Hough 1997 Richard P. Stanley
1
+ PDF Chat A Combinatorial Interpretation of the Area of Schröder Paths 1999 Elisa Pergola
Renzo Pinzani
1
+ Nondecreasing Dyck paths and q-Fibonacci numbers 1997 Elena Barcucci
Alberto Del Lungo
S. Fezzi
Renzo Pinzani
1
+ Uniform generation of a Schröder tree 1997 Laurent Alonso
Jean-Luc RĂ©my
René Schott
1
+ A method for the enumeration of various classes of column-convex polygons 1996 Mireille Bousquet‐MĂ©lou
1
+ PDF Chat A Probabilistic Analysis of a String Editing Problem and its Variations 1995 Guy Louchard
Wojciech Szpankowski
1
+ Asymptotic properties of some underdiagonal walks generation algorithms 1999 Guy Louchard
1
+ Marking in combinatorial constructions: Generating functions and limiting distributions 1995 Michael Drmota
MichĂšle Soria
1
+ Asymptotic bounds for the number of convex n-ominoes 1974 David A. Klarner
Ronald L. Rivest
1
+ Two bijections for the area of Dyck paths 2001 Elisa Pergola
1
+ Diffusion Processes and Their Sample Paths. 1996 PALE
Kiyosi ItĂŽ
H. P. McKean
1
+ Some asymptotic formulas for lattice paths 1986 Lajos TakĂĄcs
1
+ Central and local limit theorems applied to asymptotic enumeration 1973 Edward A. Bender
1
+ A Classic Proof of a Recurrence for a Very Classical Sequence 1997 Dominique Foata
Doron Zeilberger
1
+ On Convergence Rates in the Central Limit Theorems for Combinatorial Structures 1998 Hsien‐Kuei Hwang
1
+ PDF Chat Some problems of non-associative combinations (I) 1940 I. M. H. Etherington
1
+ PDF Chat Deux propriétés combinatoires des nombres de Schröder 1988 Dominique Gouyou-Beauchamps
Bernard Vauquelin
1
+ PDF Chat Convergence of Probability Measures 1999 Patrick Billingsley
1
+ Enumerative Combinatorics 1997 Richard P. Stanley
Gian‐Carlo Rota
1
+ Moments of Generalized Motzkin Paths 2000 Robert A. Sulanke
1
+ Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) 2005 M. Lothaire
1
+ Advanced Combinatorics 1974 Louis Comtet
1
+ PDF Chat Some problems of non-associative combinations (2) 1940 A. Erdelyi
I. M. H. Etherington
1
+ Combinatorics on words 1984 M. Lothaire
1
+ Convergence of Probability Measures 1969 J. F. C. KingmĂĄn
P. Billingsley
1
+ Enumerative Combinatorics 1999 Richard P. Stanley
Sergey Fomin
1
+ A schröder triangle: Three combinatorial problems 1977 Douglas G. Rogers
1
+ Algebraic languages and polyominoes enumeration 1984 M. Delest
GĂ©rard Viennot
1