Cyril Banderier

Orcid: 0000-0003-0755-3022

Affiliations:
  • University of Paris Nord, France


According to our database1, Cyril Banderier authored at least 35 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
From geometry to generating functions: rectangulations and permutations.
CoRR, 2024

Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
Height of walks with resets, the Moran model, and the discrete Gumbel distribution.
CoRR, 2023

2021
Flip-sort and combinatorial aspects of pop-stack sorting.
Discret. Math. Theor. Comput. Sci., 2021

2020
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata.
Algorithmica, 2020

Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs.
Proceedings of the Beyond the Horizon of Computability, 2020

Latticepathology and Symmetric Functions (Extended Abstract).
Proceedings of the 31st International Conference on Probabilistic, 2020

On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution.
Proceedings of the 31st International Conference on Probabilistic, 2020

2019
On the Period mod m of Polynomially-Recursive Sequences: a Case Study.
J. Integer Seq., 2019

Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux.
CoRR, 2019

2018
Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version).
CoRR, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects.
Proceedings of the Language and Automata Theory and Applications, 2018

Local time for lattice paths and the associated limit laws.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Rectangular Young tableaux with local decreases and the density method for uniform random generation.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Periodic Pólya Urns and an Application to Young Tableaux.
Proceedings of the 29th International Conference on Probabilistic, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Lattice paths with catastrophes.
Electron. Notes Discret. Math., 2017

2016
Right-jumps and pattern avoiding permutations.
Discret. Math. Theor. Comput. Sci., 2016

Lattice paths below a line of rational slope.
CoRR, 2016

Some reflections on directed lattice paths.
CoRR, 2016

2015
Formulae and Asymptotics for Coefficients of Algebraic Functions.
Comb. Probab. Comput., 2015

Lattice paths of slope 2/5.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
Analysis of an Exhaustive Search Algorithm in Random Graphs and the n<sup>clog n</sup>-Asymptotics.
SIAM J. Discret. Math., 2014

2012
Enumeration and asymptotics of restricted compositions having the same number of parts.
Discret. Appl. Math., 2012

Analysis of an exhaustive search algorithm in random graphs and the n<sup>c log n</sup>-asymptotics.
CoRR, 2012

Biodiversity of Pattern Distributions in Combinatorial Ecosystems.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2009
Analysis of three graph parameters for random trees.
Random Struct. Algorithms, 2009

2004
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
CoRR, 2004

Why Delannoy numbers?
CoRR, 2004

2003
Smoothed Analysis of Three Combinatorial Problems.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Introduction.
Proceedings of the Discrete Random Walks, 2003

2002
Basic analytic combinatorics of directed lattice paths.
Theor. Comput. Sci., 2002

Generating functions for generating trees.
Discret. Math., 2002

2001
Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
Random Struct. Algorithms, 2001

2000
Planar Maps and Airy Phenomena.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000


  Loading...