LIPN : OCAD

Curriculum vitae

05-19-1975 Here I came! 1975-1995 Censored (but here is a proof I went to school) 1995-1996 Licence de mathématiques, université de Rouen 1996-1997 Maîtrise de mathématiques and maîtrise d'ingénierie mathématique 1997-1998 DEA algorithmique, Paris April-June 98 Training period in the Algorithms project, in the French national institute for computer science Inria. October 98-Oct 01 Thesis in the same team (thesis defended 06-25-2001). October 01-Oct 02 Postdoc in the "Algorithms and Complexity Group" of the Max-Planck-Institut für Informatik, Saarbrücken October 2002-...: CNRS researcher, in the University of Paris Nord.

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 ALCOM-FT supported by the European Community.

From January 2005 to Decembrer 2006, I was the French coordinator of an "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 franco-tunisian project (projet 09/R 15-7 DGRSRT-CNRS).

I am one of the professors in the Master Recherche in mathematics and computer science of the University of Paris 13.

I also devote a part of my time to scientific popularization, I have the pleasure to work with different associations: Animaths, Math.en.jeans, Math pour Tous, Science Académie, Science Ouverte, Club CNRS sciences et citoyens, Société Mathématique de France, and some yearly events: Rencontres CNRS-jeunes, Savante Banlieue, Fête de la science, salon de la culture et des jeux mathématiques.

Thesis:

Analytic combinatorics of paths and maps.

Here are informations about my PhD defense.

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.

Articles & Preprints:

• 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

• Generating Functions for Generating Trees, C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps (Nov. 1999 version), 27 pages. Discrete Mathematics 246(1-3), March 2002, pp. 29-55 :
  (subsumes INRIA Research-Report #3661 and the FPSAC'99 conference version, Nov. 98: On Generating Functions of Generating Trees, ps )
  ps
• 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 3-540-67247-8):
  ps
• On the Sum of the Sizes of Binary Subtrees of a Perfect Binary Tree, C. Banderier, (Jun. 2000), 2 pages. Personal note
  ps
• 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
• Factors' paradox, C. Banderier, (Feb. 2001), Poster for Discrete Models'01 ps
• 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 3-4, pp. 194-246, Oct. 2001, (special volume for D.E. Knuth's (100)₈th birthday)
  (Subsumes the Jan. 2000 conference version "Planar Maps and Airy Phenomena", proceedings of ICALP'00, Springer, LNCS 1853, ps )
  ps
• Basic Analytic Combinatorics of Directed Lattice Paths, C. Banderier, Ph. Flajolet, (June 2001), 39 pages. Theoretical Computer Science Vol. 281. Issue 1-2, pp. 37-80, Jun. 2002, (special volume dedicated to M. Nivat),
  ps
• 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
• 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 ]
  ps
• Smoothed analysis of three combinatorial algorithms, C. Banderier, R. Beier, K. Mehlhorn (Apr. 2003), 13 pages. Mathematical Fundations of Computer Science (MFCS'03), pp. 198-207, LNCS 2747, 2003.
  ps
• 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 40-54 (Nov. 2005)
  (Subsumes the Lattice Paths'02 conference version, "Why Delannoy's numbers?", by C.Banderier, May 2002.)
  ps
• Generating functions for kernels of digraphs (Enumeration & asymptotics for a constraint from game theory), C. Banderier, Jean-Marie Le Bars, V. Ravelomanana Proceedings of FPSAC'04, July 2004, pp 91-105
  ps
• The Influence of Real-Time Models on Cyberinformatics, C. Banderier, W. Gates, C.F. Gauss, J. Chirac and A. Einstein. Proceedings of RSMMC'05 (Random Stupid Money-Making 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. 345-355. 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. 42-69, 2009. 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
• 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 D-finite sequences. C. Banderier, Felix Chern, Hsien-Kuei Hwang. In preparation.
• Average Case Analysis of NP-complete Problems: Maximum Independent Set and Exhaustive Search Algorithms. C. Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana, Vytas Zacharovas. In preparation.
• The Moran Model, a cache algorithm, and height of an associated random walk. C. Banderier, Rafik Aguech. In preparation.

Seminar summaries: There is 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 Gouyou-Beauchamps. 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 Bousquet-Mé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)
• "Loop-Erased 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 Boundary-Value 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 Bousquet-Mélou. May 13, 2002. ( ps)

Talks / Presentations / Conferences:

Fun:

• Tertulias and chocolate (list of bets made in the Project).
• Soon an olympic discipline: chess.
• I love football...
• I like jingoistic chauvinism: French military victories
• You want to play go, this wonderful Asian game... Jean-Loup's Go page will help you!
• My own library
• Wedstats4u gives some statistics about this webpage. (Bad news : Webstats4u is the new free version of Nedstat, and it now generates sometimes a pop-up.).

Contact: