Sylvie Corteel

According to our database1, Sylvie Corteel authored at least 34 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Combinatorics of the 2-Species Exclusion Processes, Marked Laguerre Histories, and Partially Signed Permutations.
Electron. J. Comb., 2020

2018
Bumping sequences and multispecies juggling.
Adv. Appl. Math., 2018

2016
Patterns in Inversion Sequences I.
Discret. Math. Theor. Comput. Sci., 2016

2015
Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformation.
J. Comb. Theory, Ser. A, 2015

Bijections between affine hyperplane arrangements and valued graphs.
Eur. J. Comb., 2015

2014
Perfect sampling algorithm for Schur processes.
CoRR, 2014

2011
Plane overpartitions and cylindric partitions.
J. Comb. Theory, Ser. A, 2011

Combinatorics on permutation tableaux of type A and type B.
Eur. J. Comb., 2011

The Matrix Ansatz, orthogonal polynomials, and permutations.
Adv. Appl. Math., 2011

2009
Bijections for permutation tableaux.
Eur. J. Comb., 2009

2007
Overpartitions, lattice paths, and Rogers-Ramanujan identities.
J. Comb. Theory, Ser. A, 2007

Tableaux combinatorics for the asymmetric exclusion process.
Adv. Appl. Math., 2007

Crossings and alignments of permutations.
Adv. Appl. Math., 2007

2006
An iterative-bijective approach to generalizations of Schur's theorem.
Eur. J. Comb., 2006

Common intervals in permutations.
Discret. Math. Theor. Comput. Sci., 2006

A Combinatorial Derivation of the PASEP Stationary State.
Electron. J. Comb., 2006

A Local Limit Theorem in the Theory of Overpartitions.
Algorithmica, 2006

2005
On approximating the b-chromatic number.
Discret. Appl. Math., 2005

2004
An algorithmic view of gene teams.
Theor. Comput. Sci., 2004

Lecture hall theorems, <i>q</i>-series and truncated objects.
J. Comb. Theory, Ser. A, 2004

2003
The permutation-path coloring problem on trees.
Theor. Comput. Sci., 2003

Anti-Lecture Hall Compositions.
Discret. Math., 2003

Particle seas and basic hypergeometric series.
Adv. Appl. Math., 2003

2002
Frobenius Partitions and the Combinatorics of Ramanujan's Summation.
J. Comb. Theory, Ser. A, 2002

Enumeration of sand piles.
Discret. Math., 2002

A lattice path approach to counting partitions with minimum rank <i>t</i>.
Discret. Math., 2002

The Algorithmic of Gene Teams.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Random Partitions with Non Negative r<sup>th</sup> Differences.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Random Partitions with Non-negative <i>r</i>th Differences.
Adv. Appl. Math., 2001

2000
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
On the multiplicity of parts in a random partition.
Random Struct. Algorithms, 1999

1998
A Pentagonal Number Sieve.
J. Comb. Theory, Ser. A, 1998

A Bijection for Partitions with All Ranks at Least t.
J. Comb. Theory, Ser. A, 1998

Durfee Polynomials.
Electron. J. Comb., 1998


  Loading...