Publications

International conferences:

  • 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.

 

Journals:

 

  • 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
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *