default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCyril Banderier
Person information
- affiliation: University of Paris Nord, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Cyril Banderier, Markus Kuba, Stephan Wagner, Michael Wallner:
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. AofA 2024: 7:1-7:18- [i17]Andrei Asinowski, Cyril Banderier:
From geometry to generating functions: rectangulations and permutations. CoRR abs/2401.05558 (2024) - 2023
- [i16]Rafik Aguech, Asma Althagafi, Cyril Banderier:
Height of walks with resets, the Moran model, and the discrete Gumbel distribution. CoRR abs/2311.13124 (2023) - 2021
- [j13]Andrei Asinowski
, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - 2020
- [j12]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. Algorithmica 82(3): 386-428 (2020) - [c13]Andrei Asinowski, Cyril Banderier:
On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution. AofA 2020: 1:1-1:16 - [c12]Cyril Banderier, Marie-Louise Lackner, Michael Wallner:
Latticepathology and Symmetric Functions (Extended Abstract). AofA 2020: 2:1-2:16 - [c11]Cyril Banderier, Massimiliano Goldwurm:
Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs. CiE 2020: 251-263 - [i15]Andrei Asinowski, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. CoRR abs/2003.04912 (2020)
2010 – 2019
- 2019
- [j11]Cyril Banderier, Florian Luca:
On the Period mod m of Polynomially-Recursive Sequences: a Case Study. J. Integer Seq. 22(5): 19.5.2 (2019) - [i14]Cyril Banderier, Philippe Marchal, Michael Wallner:
Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux. CoRR abs/1912.01035 (2019) - 2018
- [c10]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem. AofA 2018: 10:1-10:14 - [c9]Cyril Banderier, Philippe Marchal, Michael Wallner:
Periodic Pólya Urns and an Application to Young Tableaux. AofA 2018: 11:1-11:13 - [c8]Cyril Banderier, Philippe Marchal, Michael Wallner:
Rectangular Young tableaux with local decreases and the density method for uniform random generation. GASCom 2018: 60-68 - [c7]Cyril Banderier, Michael Wallner:
Local time for lattice paths and the associated limit laws. GASCom 2018: 69-78 - [c6]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. LATA 2018: 195-206 - [i13]Cyril Banderier, Philippe Marchal, Michael Wallner:
Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version). CoRR abs/1805.09017 (2018) - [i12]Cyril Banderier, Michael Wallner:
Local time for lattice paths and the associated limit laws. CoRR abs/1805.09065 (2018) - [i11]Cyril Banderier, Philippe Marchal, Michael Wallner:
Periodic Pólya urns and an application to Young tableaux. CoRR abs/1806.03133 (2018) - 2017
- [j10]Cyril Banderier, Michael Wallner:
Lattice paths with catastrophes. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j9]Cyril Banderier, Michael Wallner:
Lattice paths with catastrophes. Electron. Notes Discret. Math. 59: 131-146 (2017) - [i10]Cyril Banderier, Michael Wallner:
Lattice paths with catastrophes. CoRR abs/1707.01931 (2017) - 2016
- [j8]Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos:
Right-jumps and pattern avoiding permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [i9]Cyril Banderier, Michael Wallner:
Some reflections on directed lattice paths. CoRR abs/1605.01687 (2016) - [i8]Cyril Banderier, Michael Wallner:
Lattice paths of slope 2/5. CoRR abs/1605.02967 (2016) - [i7]Cyril Banderier, Michael Wallner:
Lattice paths below a line of rational slope. CoRR abs/1606.08412 (2016) - 2015
- [j7]Cyril Banderier, Michael Drmota:
Formulae and Asymptotics for Coefficients of Algebraic Functions. Comb. Probab. Comput. 24(1): 1-53 (2015) - [c5]Cyril Banderier, Michael Wallner:
Lattice paths of slope 2/5. ANALCO 2015: 105-113 - [i6]Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos:
Right-jumps and pattern avoiding permutations. CoRR abs/1512.02171 (2015) - 2014
- [j6]Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana, Vytas Zacharovas:
Analysis of an Exhaustive Search Algorithm in Random Graphs and the nclog n-Asymptotics. SIAM J. Discret. Math. 28(1): 342-371 (2014) - 2012
- [j5]Cyril Banderier, Pawel Hitczenko:
Enumeration and asymptotics of restricted compositions having the same number of parts. Discret. Appl. Math. 160(18): 2542-2554 (2012) - [c4]Cyril Banderier, Olivier Bodini, Yann Ponty, Hanane Tafat Bouzid:
Biodiversity of Pattern Distributions in Combinatorial Ecosystems. ANALCO 2012: 107-115 - [i5]Cyril Banderier, Pawel Hitczenko:
Enumeration and asymptotics of restricted compositions having the same number of parts. CoRR abs/1201.6116 (2012) - [i4]Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana, Vytas Zacharovas:
Analysis of an exhaustive search algorithm in random graphs and the nc log n-asymptotics. CoRR abs/1207.6549 (2012)
2000 – 2009
- 2009
- [j4]Cyril Banderier, Markus Kuba, Alois Panholzer:
Analysis of three graph parameters for random trees. Random Struct. Algorithms 35(1): 42-69 (2009) - 2004
- [i3]Cyril Banderier, Sylviane R. Schwer:
Why Delannoy numbers? CoRR math.CO/0411128 (2004) - [i2]Cyril Banderier, Jean-Marie Le Bars, Vlady Ravelomanana:
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games). CoRR math.CO/0411138 (2004) - [i1]Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. CoRR math.CO/0411250 (2004) - 2003
- [c3]Cyril Banderier, Christian Krattenthaler:
Introduction. DRW 2003: 1-8 - [c2]Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207 - [e1]Cyril Banderier, Christian Krattenthaler:
Discrete Random Walks, DRW'03, Paris, France, September 1-5, 2003. DMTCS Proceedings AC, DMTCS 2003 [contents] - 2002
- [j3]Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. Discret. Math. 246(1-3): 29-55 (2002) - [j2]Cyril Banderier, Philippe Flajolet:
Basic analytic combinatorics of directed lattice paths. Theor. Comput. Sci. 281(1-2): 37-80 (2002) - 2001
- [j1]Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria:
Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Struct. Algorithms 19(3-4): 194-246 (2001) - 2000
- [c1]Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria:
Planar Maps and Airy Phenomena. ICALP 2000: 388-402
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
