Olivier Bodini

According to our database1, Olivier Bodini authored at least 61 papers between 2001 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency.
Discret. Math. Theor. Comput. Sci., 2021

Generalized Tilings with Height Functions.
CoRR, 2021

2020
On the number of increasing trees with label repetitions.
Discret. Math., 2020

Compaction for two models of logarithmic-depth trees: Analysis and Experiments.
CoRR, 2020

Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers.
CoRR, 2020

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.
Proceedings of the Computer Science - Theory and Applications, 2020

2019
Statistical Properties of Lambda Terms.
Electron. J. Comb., 2019

The Combinatorics of Barrier Synchronization.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

Ranked Schröder Trees.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Enumerating lambda terms by weighted length of their De Bruijn representation.
Discret. Appl. Math., 2018

MergeShuffle: a very fast, parallel random permutation algorithm.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes.
Proceedings of the 29th International Conference on Probabilistic, 2018

Asymptotic Distribution of Parameters in Random Maps.
Proceedings of the 29th International Conference on Probabilistic, 2018

Polynomial tuning of multiparametric combinatorial samplers.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Efficient random sampling of binary and unary-binary trees via holonomic equations.
Theor. Comput. Sci., 2017

Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation.
ACM Trans. Algorithms, 2017

Extended boxed product and application to synchronized trees.
Electron. Notes Discret. Math., 2017

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2017

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets.
Proceedings of the Computer Science - Theory and Applications, 2017

The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Parallel Galton Watson Process.
CoRR, 2016

A Quantitative Study of Pure Parallel Processes.
Electron. J. Comb., 2016

Increasing Diamonds.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Associativity for Binary Parallel Processes: A Quantitative Study.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Analytic Samplers and the Combinatorial Rejection Method.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

Cuts in Increasing Trees.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
On the asymptotic number of <i>BCK</i>(2)-terms.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013
Boltzmann samplers for <i>v</i>-balanced cycles.
Theor. Comput. Sci., 2013

Asymptotics and random sampling for BCI and BCK lambda terms.
Theor. Comput. Sci., 2013

Analytic Samplers and the Combinatorial Rejection Method
CoRR, 2013

Enumeration of Generalized BCI Lambda-terms.
Electron. J. Comb., 2013

The Combinatorics of Non-determinism.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012
Boys-and-girls Birthdays and Hadamard Products.
Fundam. Informaticae, 2012

Boltzmann samplers for first-order differential specifications.
Discret. Appl. Math., 2012

Dirichlet Random Samplers for Multiplicative Combinatorial Structures.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

Biodiversity of Pattern Distributions in Combinatorial Ecosystems.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011
Distances on rhombus tilings.
Theor. Comput. Sci., 2011

Lambda-terms of Bounded Unary Height.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
Random Sampling of Plane Partitions.
Comb. Probab. Comput., 2010

How to generate an object under an ordinary Boltzmann distribution via an exponential Boltzmann sampler
CoRR, 2010

Multi-dimensional Boltzmann Sampling of context-free Languages
CoRR, 2010

The Connectivity-Profile of Random Increasing k-trees.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Stochastic Flips on Two-letter Words.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
Boltzmann Samplers for v-balanced Colored Necklaces
CoRR, 2009

Boltzmann Samplers for Colored Combinatorial Objects
CoRR, 2009

Optimal Partial Tiling of Manhattan Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Distances on Lozenge Tilings.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
A characterization of flip-accessibility for rhombus tilings of the whole plane.
Inf. Comput., 2008

2007
Tiling a Pyramidal Polycube with Dominoes.
Discret. Math. Theor. Comput. Sci., 2007

2006
Tilings on the butterfly lattice.
Eur. J. Comb., 2006

How to Tile by Dominoes the Boundary of a Polycube.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Planar Dimer Tilings.
Proceedings of the Computer Science, 2006

Tiling an Interval of the Discrete Line.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2004
Tilings with trichromatic colored-edges triangles.
Theor. Comput. Sci., 2004

Z-Tilings of Polyominoes and Standard Basis.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003
Tiling a Rectangle with Polyominoes.
Proceedings of the Discrete Models for Complex Systems, 2003

2002
On the Minimum Size of a Contraction-Universal Tree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
Tiling a Manhattan Polyomino with Bars.
Electron. Notes Discret. Math., 2001


  Loading...