Cyril Banderier
Orcid: 0000-0003-0755-3022Affiliations:
- University of Paris Nord, France
According to our database1,
Cyril Banderier
authored at least 35 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
CoRR, 2023
2021
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
Proceedings of the Beyond the Horizon of Computability, 2020
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
J. Integer Seq., 2019
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
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
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
2016
Discret. Math. Theor. Comput. Sci., 2016
2015
Comb. Probab. Comput., 2015
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
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012
2009
2004
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
CoRR, 2004
2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Introduction.
Proceedings of the Discrete Random Walks, 2003
2002
2001
Random Struct. Algorithms, 2001
2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000