Cyril Banderier's Home Page

 
Cyril Banderier
Laboratoire d'Informatique de ParisNord
UMR CNRS 7030
Institut Galilée  Université ParisNord
99, avenue JeanBaptiste Clément
93430 Villetaneuse
France
Office: A106
Phone: +33 1 49 40 40 69
Fax: +33 1 48 26 07 12
Email: Cyril.Banderier at lipn.univparis13.fr

From 1998 to 2001, I have taught
Theoretical and Practical Computer Science in University of Paris
Nord. Here are the courses.
My PhD was registered in Jussieu
and was financed by the French
Research Ministry
via the Rectorat de Paris.
I was the organizer of the Colloquium Junior and a member of the Association des Doctorants at INRIA.
I was involved in the Alcophys project and in the project ALCOMFT (20002003) supported by the European Community.
From January 2005 to Decembrer 2006, I was the French coordinator of an "Egide Amadeus" project between France and Austria.
In 2006 and 2007, I was involved in a teaching collaboration with Madagascar (in the DEA IGMA [Informatique et Génie Mathématique] at the university of Antananarivo), with fundings from the university of Paris 13 and the Agence Universitaire de la Francophonie.
From September 2008 to September 2011, I was involved in the ANR PhysComb "Physique combinatoire".
From May 2009 to May 2012, I was the French coordinator of a francotunisian project (projet 09/R 157 DGRSRTCNRS).
From September 2010 to September 2014, I was involved in the ANR Magnum "Méthodes Agorithmiques de Génération aléatoire Non Uniforme, Modèles et application" (ANR2010BLAN0204).
From May 2012 to December 2013, I was the French coordinator of a project between France and Austria (PHC "Amadeus").
From May 2012 to December 2013, I was in charge of a PEPS CNRS "Holonomix".
From May 2013 to March 2014, I was one of the participants of projet LIPNLAGA BQR MARMOT (Marches, ARbres et MOTs).
From January 2013 to December 2014, I was one of the participants of a francotaiwanese project (PHC "Orchid").
I was the webmaster of my team and of my lab from 2003 to 2013.
Since 2010, I'm in charge of our séminaire de combinatoire.
I was involved in the organization of several conferences, schools or workshops.
I am one of the professors in the
Master Recherche in mathematics and computer science
of the University of Paris 13 ; I am also teaching
in classe préparatoire
(CPES2 Feyder) and at the
Institut universitaire de technologie.
I also devote a part of my time to scientific popularization.
I had the pleasure to work with the following associations:
Animaths, Math.en.jeans,
Math pour Tous, Science Académie,
Science Ouverte, Club CNRS sciences et citoyens,
Société Mathématique de France,
Université populaire de Bondy,
Université pour tous de Bagneux,
Palais de la découverte,
Cité des Sciences & de l'Industrie,
and some yearly events:
Rencontres CNRSjeunes, Savante Banlieue
, Fête de la science,
Salon de la culture et des jeux mathématiques.
Analytic combinatorics of paths and
maps.
You can download a preliminary version
of my PhD thesis (directed by
Philippe Flajolet).
I can send you a copy of the final version,
simply email me your postal address.
For those who wonder what is a PhD student, I would recommend to read
this. That's the story of
an old friend of mine, Nicolas, who became PhD in Strasbourg.
When I was a young and innocent student, I wrote the following memoirs
(that's in French):

Around Mathematics in 80 Problems, Cyril Banderier (June 1995).
[
ps ]

Quadratic Residues, Quadratic Reciprocity Laws, Cyril
Banderier (June 1997).
[ html  ps ]

Factorization Algorithms "à l'envi", Cyril Banderier
(September 1997). [ html  ps ]

Analytic Combinatorics and Random Walks, Cyril Banderier (July
1998).
[
ps ]
Now I am a young and innocent researcher, and I wrote
the following (in English):

Generating Functions for Generating Trees, C. Banderier,
M. BousquetMélou,
A. Denise,
P. Flajolet,
D. Gardy,
D. GouyouBeauchamps.
(Nov. 1999 version), 27 pages.
Discrete Mathematics
246(13), March 2002, pp. 2955 :
(subsumes INRIA ResearchReport #3661 and the FPSAC'99 conference version, Nov. 98:
On Generating Functions of Generating Trees, ps  pdf)
[ ps  pdf ]
 A Generalized Cover Time for Random Walks on Graphs,
C. Banderier, R.P. Dobrow.
(Nov. 99., revised Feb. 00), 12 pages. In the proceedings of FPSAC'00,
published by Springer (ISBN 3540672478):
[ ps  pdf ]
 On the Sum of the Sizes of Binary Subtrees of a Perfect Binary Tree,
C. Banderier, (Jun. 2000), 2 pages. Personal note [ ps  pdf ]
 Fortunate and unfortunate primes : Nearest primes from a prime factorial,
C. Banderier, (Dec. 2000). Personal note [ html ]
 A Markovian Generalization of Feller's Coin Tossing Constants,
C. Banderier, M. Vandenbogaert,
(Nov. 2000), 4 pages. Personal note [ ps  pdf ]

Factors' paradox, C. Banderier,
(Feb. 2001), Poster for Discrete Models'01
[ ps  pdf ]
 Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena,
C. Banderier,
Ph. Flajolet,
G. Schaeffer,
M. Soria
(Mar. 2001), 52 pages. Random Structures and Algorithms
Vol 19. Issue 34, pp. 194246, Oct. 2001,
(special
volume for D.E. Knuth's (100)_{8}th
birthday)
(Subsumes the Jan. 2000 conference version "Planar Maps and Airy
Phenomena", proceedings of ICALP'00,
Springer,
LNCS 1853, ps  pdf )
[ ps  pdf ]
 Basic Analytic Combinatorics of Directed Lattice Paths,
C. Banderier,
Ph. Flajolet.
(June 2001), 39 pages.
Theoretical Computer Science
Vol. 281. Issue 12, pp. 3780, Jun. 2002, (special volume dedicated to M. Nivat),
[ ps / pdf ]
 Limit laws for basic parameters of lattice paths with unbounded jumps,
C. Banderier. (Jan. 2002), 15 pages.
Second Colloquium on Mathematics and Computer Science.
[ ps  pdf ]
 Algebraic succession rules and Lattice paths with an infinite set of jumps,
C. Banderier,
J.M. Fédou,
C. Garcia,
D. Merlini,
(Jan. 2003), 32 pages. Submitted to Discrete Mathematics.
[ Subsumes the FPSAC'02 conference version
"Lattice paths with an infinite set of jumps", C. Banderier & D. Merlini,
(Dec. 2001, revised in March 2002, 10 pages), ps  pdf ]
[ ps  pdf ]
 Smoothed analysis of three combinatorial algorithms,
C. Banderier, R. Beier, K. Mehlhorn
(Apr. 2003), 13 pages.
Mathematical Fundations of Computer Science (MFCS'03), pp. 198207,
LNCS 2747, 2003.
[ ps  pdf ]
 Discrete Random Walks Proceedings (DRW'2003),
C. Banderier, C. Krattenthaler [ Guest Editors ]
(Nov. 2003), 358 pages.
Discrete Mathematics & Theoretical Computer Science.
[ ps/pdf ]
 Why Delannoy numbers?,
C. Banderier, S. Schwer
(Feb. 2004), 14 pages.
Journal of Statistical Planning & Inference Vol. 135, Issue 1, pp 4054 (Nov. 2005)
(Subsumes the
Lattice Paths'02
conference version, "Why Delannoy's numbers?", by C.Banderier, May 2002.)
[ ps  pdf, reprint.pdf ]
 Generating functions for kernels of digraphs (Enumeration & asymptotics for a constraint from game theory),
C. Banderier, JeanMarie Le Bars, V. Ravelomanana
Proceedings of FPSAC'04, July 2004, pp 91105
[ ps  pdf ]
 The Influence of RealTime Models on Cyberinformatics,
C. Banderier, W. Gates, C.F. Gauss, J. Chirac and A. Einstein.
Proceedings of RSMMC'05
(Random Stupid MoneyMaking Conference), April 1st, 2005
[ html ]
 Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Average Area,
C. Banderier, B. Gittenberger.
Proceedings of the 4th Colloquium of Mathematics and Computer
Science, DMTCS, AG, pp. 345355. April 1st, 2006
[ pdf ]
 Analysis of three graph parameters for random trees,
Cyril Banderier, Markus Kuba, Alois Panholzer.
Random Structures & Algorithms. Vol. 35, N. 1, pp. 4269, 2009.
[ pdf ]
 Average Case Analysis of NPcomplete Problems: Maximum Independent Set and Exhaustive Search Algorithms,
C. Banderier, HsienKuei Hwang,
Vlady Ravelomanana, Vytas Zacharovas. (AofA'09, RSA'09, Journées Graphes et Algorithmes'09)
[ pdf ]
 Symplectic transformations and quantum tomography in finite quantum systems,
Cyril Banderier, Apostol Vourdas.
Journal of Physics A, Volume 43, Number 4, 29 January 2010.
[ pdf ]
 Bounded discrete walks,
Cyril Banderier, Pierre Nicodème.
In DMTCS Proceedings,
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10),
pp. 3548, 2010. [ pdf ]
 Nondirected lattice paths on different latices, Cyril Banderier, pp. 3539
Proceedings of "Lattice Path Combinatorics and Applications", 47 July 2010. [ pdf ]
 Constant time estimation of ranking statistics by analytic combinatorics
Cyril Banderier, Pierre Nicodème.
in Statistical Methods for PostGenomic Data January 2011.
[ pdf ]
 Enumeration and asymptotics of restricted compositions having the same number of parts
Cyril Banderier, Paweł Hitczenko. Discrete Mathematics and Applications.
Volume 160, Issue 18, December 2012, Pages 2542–2554. [ preprint.pdf,
journal_version.pdf ]
 Analysis of an exhaustive search algorithm in random graphs and the n^{c log n}asymptotics Cyril Banderier, HsienKuei Hwang, Vlady Ravelomanana and Vytas Zacharovas, submitted for publication (July 28, 2012). [ pdf or arXiv ]
 The Airy function and analytic combinatorics, Cyril Banderier, Guy Louchard, submitted.
 Coefficients of algebraic functions: formulae and asymptotics, Cyril Banderier,
Michael Drmota, submitted for publication [ pdf ]
 Multidimensional partitions. C. Banderier, H. Tamaki. In preparation. (The person who sent me some mails related to this work is invited to recontact me, I lost his address.)
 Area of directed lattice paths. C. Banderier, B. Gittenberger. In preparation.
 Height of directed lattice paths. C. Banderier, Philippe Flajolet. In preparation.
 Asymptotics of Dfinite sequences.
C. Banderier, Felix Chern, HsienKuei Hwang. In preparation.
 The Moran Model, a cache algorithm, and height of an associated random walk.
C. Banderier, Rafik Aguech. In preparation.
Seminar summaries:
There was a tradition to write summaries of
talks given at the
Algorithms Seminar.
Here are the summaries that I have written:
 "Enumeration Methods of Remarkable Families of Polyominoes, Animals and
Paths", by
Dominique GouyouBeauchamps. March 2, 1998.
(html 
ps)
 "Dynamics of the Binary Euclidean Algorithm: Functional
Analysis and Operators", by
Brigitte Vallée. April 27, 1998.
(html 
ps)
 "Sorted and/or Sortable Permutations", by
Mireille
BousquetMélou. June 8, 1998.
(html 
ps)
 "An Introduction to Analytic Number Theory", by
Ilan Vardi.
December 14, 1998.
(html 
ps)
 "Unified Analysis of Euclidean Algorithms", by
Brigitte Vallée. March 29, 1999.
(html 
ps)
 "LoopErased Random Walks", by
Richard Kenyon. May 31, 1999.
(html 
ps)
 "The Local Limit Theorem for Random Walks on Free Groups", by
Steve Lalley. May 31, 1999.
(html 
ps)
 "Solving Discrete Initial and BoundaryValue Problems", by Marko
Petkovsek. October 4, 1999.
(html 
ps)

"Continued fractions, comparisons algorithms and fine structure
constants", by Philippe
Flajolet. November 8, 1999.
(html 
ps)
 "Continued Fractions and Modular Forms",
by Ilan Vardi. April 3, 2000.
(html 
ps)
 "Some Sharp Concentration Results about Random Planar Triangulations",
by Jason Zhicheng
Gao. June 8, 2000.
(html 
ps)
 "The tennis ball problem", by
Donatella Merlini.
March 19, 2001
(
ps)
 "Random walks and cycles stacking", by
Philippe Marchal. April 21, 2001
(
ps)
 "Hyperharmonic numbers and coupon collector's brothers", by
Dominique
Foata. May 21, 2001
(
ps)
 "Animals, domino tilings, functional equations", by
Mireille
BousquetMélou. May 13, 2002.
(
ps)
See the conference page.
Fun:
Last modified: Monday 28 April 2014 

Contact for this webpage: Cyril.Banderier at lipn.univparis13.fr 
