Typical Questions & Approaches


Posted in tutorial | Leave a comment

Exchanging Postdoctoral researchers and PhD students

Under the project researchers have been traveling to meet their collegues in Taiwan and make joint researches. In particular Matthieu Dien went to Academia Sinica in Taipei for 10 months for a PostDoc staring from September 2017. Phd students Sergey Dovgal and Mehdi Naima have also made travels to Taipei in 2017 and 2018.

Posted in visits | Leave a comment

Workshop ALEA Young 2019


The project members are organizing the workshop ALEA Young 2019 which take place from May 19th to May 24th, 2019 in Normandy, France.

The workshop ALEA Young 2019 is part of a series of workshops
(Oxford’12, Paris’13, Bath’15, Vienna’16, Paris’17) about
random discrete structures arising from domains such that Computer
Science, Mathematics, Bioinformatics, Physics.

This year attendees will follow three lessons given by:
-Elise Goujard about flat surfaces and counting problems
-Irène Marcovici about probabilistic cellular automata
-Fiona Skerman about nice random graph theory
just as long and short talks given by the participants.
Also, special sessions will be reserved to work on open problems
brought by the participants (e.g. open questions or software

The workshop will be held in “le Domaine de la Tour” at
Saint-Pierre-Canivet (close from Caen in Normandy, France).

A website giving more details has been set for the event.

Posted in workshop | Leave a comment

Meeting in Caen (January 31 – February 1)

French part of the project met last January 31 and February 1 in the University of Caen.

We were lucky to attend to the talks of Danièle Gardy (UVSQ), Julien Clément (UNICAEN) and Antoine Genitrini (Sorbonne Université). During the working sessions we were happy to work on analysis of text algorithm (Brigitte Vallée and Julien Clément), Boltzmann random generation (Martin Pépin and Matthieu Dien) and some problems around Binary Decision Diagramm suggested by Alexandre Niveau (UNICAEN).


Danièle Gardy : Compter les sous-graphes (Enumerating the subgraphs)

Julien CLément and Antoine Genitrini : La combinatoire des Diagrammes de Décision Binaire (The combinatorics of Binary Decision Diagram)

Posted in workshop | Leave a comment

Computational Logic and Applications

The Computational Logic and Applications (CLA) workshops are a series of annual meetings (cf. https://cla.tcs.uj.edu.pl), whose main purpose is to provide a free and open forum for research on combinatorial and quantitative aspects of mathematical logic and their applications in computer science. The next meeting will take place in Versailles (France) in July 1-2, 2019. It will be  followed by a special issue of DMTCS dedicated to the same topics.

Topics within the scope of CLA include:
– combinatorics of lambda calculus and related formalisms,
– quantitative aspects of program evaluation and normalisation,
– asymptotic enumeration in computational logic,
– statistical properties of formulae, terms and programs,
– random generation of large combinatorial structures in computational logic,
– randomness in software testing and counter-example generation methods.

WEBSITE : https://cla.tcs.uj.edu.pl/

Posted in workshop | Leave a comment

Tutorial and Workshop on Analytic and Enumerative Aspects of Combinatorics

  • Description:This is the second joint meeting between this project and the participants of our FWF-MOST project (http://rsd.stat.sinica.edu.tw/). The first took place in Paris from September 1st to September 2nd, 2016. The purpose of this meeting is to present recent research results of the participants of the two projects and discuss further joint collaborations. The meeting will start with a one-day tutorial which will be mainly geared towards students. Moreover, the meeting will be open to the local research community in Combinatorics (both students and researchers are welcome!).
  • Date:    Friday, October 27, 2017 to Sunday, October 29, 2017
  • Place:   Department of Applied Mathematics, National Chiao Tung University (NCTU)
  • Program:October 27, 2017: Tutorial given by Michele Soria (Pierre and Marie Curie University) and Bernhard Gittenberger (Technical University of Vienna)October 28-29, 2017: Workshop with approximately 10 talks
  • Accommodation:On-campus accommodation is limited; it’s more convenient but doesn’t include breakfast (however, there are many restaurants at NCTU’s campus). Off-campus accommodation, if further away from the campus, requires either a long walk or commuting by taxi (Hsinchu’s public transport system is less convenient). All places listed below can also be found on tripadvisor.On-campus guest houses:1. Guest house II $1,000/night; $200+ for double occupancy Guest house III, $1,500 NTD/night(single occupancy); $200+ for double occupancy Landis Inn Chuhu, $3,300 NTD/night, complimentary breakfast; 5-minute walk to NCTU (ca. 350m from the main gate)
    2. Berkeley Hotel $1,800 NTD/night, complimentary breakfast, 20-minute walk to NCTU via the campus of the neighboring Tsing-HuaUniversity
Posted in tutorial | Leave a comment

Meeting in Paris 2016

  • Wed., September 7, 2016 at LIPN
    •  Participants: Hsien-Kuei Hwang & Cyril Banderier
  • Tue., September 6, 2016 in London
    •  Participants: Hsien-Kuei Hwang & Svante Janson
  • Mon., September 5, 2016 at LiP6
    •  Participants: Hsien-Kuei Hwang, Antoine Genitrini & Olivier Bodini
  • 10am-5pm, Wed., August 31, 2016 at LIPN
    •  Participants: Yeong-Nan Yeh, Wei-Mei Chen, Bo-Yin Yang, Hsien-Kuei Hwang, Sara Kropf, Cyril Banderier, Axel Bacher & Olivier Bodini
  • 10am-6pm, Tue., August 30, 2016 at LiP6
    • Participants: Yeong-Nan Yeh,  Wei-Mei Chen, Sara Kropf, Hsien-Kuei Hwang, Cyril Banderier, Olivier Bodini, Mathieu Dien, Antoine Genitrini & Michael Wallner
  • 2-4pm, Mon., August 29, 2016 at LIX
    •  Participants: Michael Fuchs, Wei-Mei Chen, Sara Kropf, Hsien-Kuei Hwang, Mireille Regnier, Jean-Marc Steyaert & Joris van der Hoeven
  • Fri., June 3, 2016 at Academia Sinica
    •  Topic:
      1. discussed the budget use for attending the workshop on September 1-2 at LiP6 and extended visit to other laboratories
      2. Current research themes: diverse combinatorial models, related recurrences and asymptotics
      3. GPU implementation of classical algorithms
    •  Participants: Yeong-Nan Yeh, Michael Fuchs, Tsung-Hsi Tsai, Wei-Mei Chen,
      Wei-Chung Liu, Sara Kropf & Hsien-Kuei Hwang
  •  Thu., March 3, 2016 at Academia Sinica
    • Topic: stochastic and combinatorial models for food-webs and task graphs
    • Participants: Antoine Genitrini, Hsien-Kuei Hwang, Wei-Chung Liu &
      Tsung-Hsi Tsai
  • Fri., January 15, 2016 at Academia Sinica
    • Participants: Yeong-Nan Yeh, Michael Fuchs, Tsung-Hsi Tsai, Bo-Yin Yang,
      Wei-Mei Chen & Hsien-Kuei Hwang


Posted in workshop | Leave a comment

Asymptotic Analysis of Algorithms & Combinatorial Structures (A3CS) workshop program

The program is now available here.

See you in Paris, the September 1 and 2.
To access to the workshop:
– Metro 7 or 10: Station Place Jussieu.
– You will be asked to open your bag when you enter the campus.
– Go to the left to the tower 25
– Take the elevator to the 1st level.
– Enter the corridor 25-26.
– The room 105 is on your left.

Posted in workshop | Leave a comment

Announcement: Asymptotic Analysis of Algorithms & Combinatorial Structures (A3CS) Workshop

The Asymptotic Analysis of Algorithms & Combinatorial Structures
(A3CS) Workshop will take place on September 1-2 (Thursday-Friday).

This is a workshop organized by the ANR-MOST (France-Taiwan).

Are specially invited, French and Taiwanaise participants of the ANR, but also other researchers (Technische Universität Wien team (Austria),…).

Talks will focus on the following themes: Analysis of
Algorithms, Analytic Combinatorics, Random Combinatorial Structures
and some others on related subjects.

Discussions will be largely encouraged and some dedicated moments are planned.
The workshop will take place in Paris at the Université Pierre et
Marie Curie (Paris 6, campus Jussieu).

Further details will be available on this web site as soon as possible.

Posted in workshop | Leave a comment


International conferences:


  • O. Bodini, M. Dien, A. Genitrini and F. Peschanski: Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. CSR’17.
  • Olivier Bodini, Antoine Genitrini and Mehdi Naima: Ranked Schröder trees . Analco’19.
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini and Alfredo Viola: Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes. Accepted for AOFA’18.
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini and Frédéric Peschanski: The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes.  Analco’17.
  • Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei HwangIncreasing Diamonds. LATIN 2016: 207-219
  • Olivier Bodini, David Julien, Philippe Marchal: Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. CALDAM 2016: 97-114
  • Antoine Genitrini: Full asymptotic expansion for Polya structures. AofA 2016
  • O. Bodini, A. Genitrini, and N. Rolin: Extended boxed product and application to synchronized trees. In Proc. Gascom’16.
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski: Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. Accepted for CSR’17.
  • O. Bodini, M. Dien, A. Genitrini and F. Peschanski: The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. In proc. of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO, 2017, p.16-30.




  • A. Bacher, O. Bodini, H.K. Hwang, T.H. Tsai: Transactions on Algorithms (TALG), Volume 13 Issue 2, February 2017
  • O. Bodini, A. Genitrini, F. Peschanski: A Quantitative Study of Pure Parallel Processes. Electr. J. Comb. 23(1): P1.11 (2016)
  • O. Bodini, A. Genitrini, N. Rolin: Pointed versus Singular Boltzmann Samplers: a Comparative Analysis. To appear in PUMA, 2016.
  • V. Bonzom: Large N Limits in Tensor Models: Towards More Universality Classes of Colored Triangulations in Dimension d>1, SIGMA, vol 12, 2016.
  • A. Bacher, A. Sportiello: Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution.Algorithmica 75(4): 812-831, 2016
  • V. Berthé, L. Lhote, B. Vallée: Probabilistic analyses of the plain multiple GCD algorithm, Journal of Symbolic Computation 74, 425—474, 2016
  • B. Vallée, Genealogy of lattice reduction: algorithmic description and dynamical analyses,   RIMS Kyokuroku Bessatsu, 121—175, 2016)
  • J. Clément, J. Fill,  T.H. Nguyen Thi, B. Vallée: Towards a realistic analysis of the QuickSelect algorithm, Theory of Computing Systems, 58(4), 528-578, 2016
Posted in conferences | Leave a comment