Publications

Counting embeddings of rooted trees into families of
rooted trees
(with Zbigniew Gołębiewski, Isabella Larcher and Małgorzata Sulkowska).
Submitted.
Preprint: arXiv 2008.08312.

Counting phylogenetic networks with few reticulation vertices: exact enumeration and corrections
(with Michael Fuchs and Marefatollah Mansouri).
Submitted.
Preprint: arXiv 2006.15784.

Compaction for two models of
logarithmicdepth trees: analysis and experiments
(with Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher and Mehdi Naima).
Submitted.
Preprint: arXiv 2005.12997.

Protection numbers in simply generated trees
and Pólya trees
(with Zbigniew Gołębiewski, Isabella Larcher and Małgorzata Sulkowska).
Applicable Analysis and Discrete Mathematics, to appear.
Preprint: arXiv 1904.03519.

Threshold functions for small subgraphs in simple graphs and multigraphs
(with Gwendal Collet, Élie de Panafieu, Danièle Gardy and Vlady Ravelomanana).
European Journal of Combinatorics 88, 103113, 44 pp., 2020.

On the number of increasing trees with label
repetitions
(with Olivier Bodini, Antoine Genitrini, and Stephan Wagner).
Discrete Mathematics 343(8), 111722, 12 pp., 2020.

Asymptotic enumeration of compacted binary trees of bounded right height
(with Antoine Genitrini, Manuel Kauers and Michael Wallner).
Journal of Combinatorial Theory, Ser. A 172, 105177, 49 pp., 2020.

Analytic
combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and
generating functions for pushdown automata
(with Andrei Asinowski, Axel Bacher and Cyril Banderier).
Algorithmica 82(3), 386428, 2020.

Distribution of variables in lambdaterms with restrictions on De Bruijn indices and De Bruijn levels
(with Isabella Larcher).
Electronic Journal of Combinatorics 26(4), P 4.47, 2019.

Counting phylogenetic networks with few reticulation vertices: treechild and normal networks
(with Michael Fuchs and Marefatollah Mansouri).
Australasian Journal of Combinatorics 73(2):385423, 2019.

Analytic combinatorics of lattice paths with forbidden patterns:
asymptotic aspects and Borges's theorem
(with Andrei Asinowski, Axel Bacher and Cyril Banderier).
LIPIcs, Vol. 110  Aofa 2018, 10:110:14, 2018.

On the number of variables in special classes of random lambdaterms
(with Isabella Larcher).
LIPIcs, Vol. 110  Aofa 2018, 25:125:14, 2018.

Analytic combinatorics of lattice paths with forbidden patterns:
enumerative aspects
(with Andrei Asinowski, Axel Bacher and Cyril Banderier).
In Language and Automata Theory and Applications, 12th International Conference. LATA 2018,
LNCS 10792:195206, Springer 2018.

Enumerating lambda terms by weighted length of their De Bruijn representation
(with Olivier Bodini and Zbigniew Gołębiewski).
Discrete Applied Mathematics 239:4561, 2018.

On the shape of random Pólya structures
(with Emma Yu Jin and Michael Wallner).
Discrete Mathematics 341(4):896911, 2018.

On the number of unarybinary treelike structures with restrictions on the unary height
(with Olivier Bodini, Danièle Gardy and Zbigniew Gołębiewski).
Annals of Combinatorics 22(1):4591, 2018.

Threshold functions for small subgraphs: an analytic approach
(with Gwendal Collet, Élie de Panafieu, Danièle Gardy and Vlady Ravelomanana).
Electronic Notes in Discrete Mathematics 61:271277, 2017.

A note on the scaling limits of random Pólya trees
(with Emma Yu Jin and Michael Wallner).
Proceedings of the 14th Workshop on Analytic Algorithmics and Combinatorics
(ANALCO), 8593, 2017.

The relation between tree size complexity and probability for Boolean functions generated by
uniform random trees
(with Veronika Daxner, Antoine Genitrini and Cécile Mailler).
Applicable Analysis and Discrete Mathematics 10(2):408446, 2016.

2XOR revisited: satisfiability and probabilities of functions
(with Élie de Panafieu, Danièle Gardy, and Markus Kuba).
Algorithmica 76(4):10351076, 2016.

On the number of lambda terms with prescribed size of their De Bruijn representation
(with Zbigniew Gołębiewski).
LIPIcs, Vol. 47  STACS 2016, 40:140:13, 2016.

Associative and commutative tree representations for Boolean functions
(with Antoine Genitrini, Veronika Kraus and Cécile Mailler).
Theoretical Computer Science 570:70101, 2015.

No Shannoneffect induced by And/Or trees
(with Antoine Genitrini and Cécile Mailler).
DMTCS Proceedings BA:109120, 2014.

Probabilities of 2XOR functions
(with Élie de Panafieu, Danièle Gardy, and Markus Kuba).
LATIN 14, LNCS 8392:454465, Springer, Berlin, 2014.

On the asymptotic number of ${BCK}(2)$terms
[pdf]
(with Olivier Bodini).
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and
Combinatorics (ANALCO), pp. 2539, 2014.

Enumeration of generalized BCI lambdaterms
[pdf]
(with Olivier Bodini, Danièle Gardy and Alice Jacquot).
Electronic Journal of Combinatorics 20, Article P30, 23pp., 2013.

Probabilities of Boolean functions given by random implicational formulas
[pdf]
(with Antoine Genitrini, Veronika Kraus and Cécile Mailler).
Electronic Journal of Combinatorics 19, Article P37, 20+6pp., 2012. Erratum: 2014.

Infinite systems of functional equations and Gaussian limiting distributions
(with Michael Drmota and Johannes Morgenbesser).
DMTCS Proceedings AQ:453478, 2012.

On the number of transversals in random trees
(with Veronika Kraus).
DMTCS Proceedings AQ:141154, 2012.

The degree profile of random Pólya trees
(with Veronika Kraus).
Journal of Combinatorial Theory, Ser. A 119:15281557, 2012.

The fraction of large random trees representing a given Boolean function in implicational logic
(with Hervé Fournier, Danièle Gardy and Antoine Genitrini).
Random Structures and Algorithms 40(3):317349, 2012.

Lambdaterms of bounded unary height
[pdf]
(with Olivier Bodini and Danièle Gardy).
In Proceedings of the Eighth Workshop on Analytic Algorithmics and
Combinatorics (ANALCO11), pp. 2332, 2011.

The shape of unlabeled rooted random trees
(with Michael Drmota).
European Journal of Combinatorics 31(8):20282063, 2010.

No Shannon effect on probability distributions on Boolean functions induced by random
expressions
(with Antoine Genitrini).
DMTCS Proceedings AM:305318, 2010.

Combinatorial models for cooperation networks
(with Michael Drmota and Reinhard Kutzelnigg).
In Proceedings of the 20th International Workshop on Combinatorial Algorithms, LNCS
5874, 206217, Springer 2009.

On the shape of the fringe of various types of random trees
(with Michael Drmota, Alois Panholzer, Helmut Prodinger, and Mark D. Ward). Mathematical
Methods in the Applied Sciences 32, 12071245, 2009.

Analytic Combinatorics on Random Graphs (with Michael Drmota). In
Analysis of Complex Networks: From Biology to Linguistics,
M. Dehmer and F. EmmertStreib Eds., Wiley 2009.

The degree distribution in thickened trees
(with Michael Drmota and Alois Panholzer).
DMTCS Proceedings AG, 5th
Colloquium of Mathematics and Computer Science, Blaubeuren, pp. 153166, 2008.

Complexity and limiting ratio of Boolean functions over implication
(with Hervé Fournier, Antoine Genitrini, and Danièle Gardy). Proceedings of the 33rd
International Symposium on Mathematical Foundations of Computer Science,
LNCS 5162/2008, pp. 347362, Springer 2008.

Hayman admissible functions in several variables
(with Johannes Mandlburger).
Electronic Journal of Combinatorics 13, Article 106, 29 pp., 2006.

Analytic Combinatorics of Lattice Paths: Enumeration and Asymtpotics for the Average Area
(with Cyril Banderier).
In 4th Colloquium of Mathematics and Computer Science, DMTCS Proceedings AG:345355, 2006.

Nodes of large degree in random trees and forests.
Random Structures and Algorithms 28(3):374385, 2006.

Some results for monotonically labelled simply generated trees
(with Alois Panholzer).
In 2005 International Conference on Analysis of Algorithms,
DMTCS Proceedings AD:173180, 2005.

The profile of unlabeled trees.
In 2005 International Conference on Analysis of Algorithms, DMTCS Proceedings,
AD:167172, 2005.

Extended admissible functions and Gaussian limiting distributions
(with Michael Drmota and Thomas Klausner).
Mathematics of Computation 74:19531966, 2005.

And/Or trees revisited
(with Brigitte Chauvin, Philippe Flajolet, and Danièle Gardy).
Combinatorics, Probability, and Computing 13(45):475497, 2004.

The width of GaltonWatson trees
(with Michael Drmota).
Discrete Mathematics and Theoretical Computer Science 6(2):387400, 2004.

Reflected Brownian bridge local time conditioned on its local time at the origin
(with Guy Louchard).
Statistics and Probability Letters 68(1):5160, 2004.

General urn models with several types of balls and Gaussian limiting fields
(with Michael Drmota and Danièle Gardy).
Random Structures and Algorithms 24(1):75103, 2004.

A note on "State spaces of the snake and its tour  Convergence of the discrete snake"
by J.F. Marckert and A. Mokkadem.
Journal of Theoretical Probability 16(4):10631067, 2003.

On the profile of random forests.
In Mathematics and Computer Science II,
B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem eds., Birkhäuser, 2002, pp. 279293.

A unified presentation of some urn models
(with Michael Drmota and Danièle Gardy).
Algorithmica 29(12):120147, 2001.

Asymptotic normality of badditive functions on polynomial sequences in the Gaussian number
field
(with Jörg M. Thuswaldner).
Journal of Number Theory 84:317341, 2000.

The number of descendants in simply generated random trees.
In Mathematics and Computer Science, D. Gardy and A. Mokkadem(eds.),
Birkhäuser, 2000, pp. 6573.

On the local time density of the reflecting Brownian bridge
(with Guy Louchard).
Journal of Applied Mathematics and Stochastic Analysis 13(2):125136, 2000.

The Brownian excursion multidimensional local time density
(with Guy Louchard).
Journal of Applied Probability 36(2):350373, 1999.

A note on a model in ruin theory using derivative securities.
Grazer Mathematische Berichte 338:18, 1999.

On the contour of random trees [pdf].
SIAM Journal on Discrete Mathematics 12(4):434458, 1999.

Strata of random mappings  a combinatorial approach
(with Michael Drmota).
Stochastic Processes and their Applications 82:157171, 1999.

The distribution of nodes of given degree in random trees
(with Michael Drmota).
Journal of Graph Theory 31:227253, 1999.

The moments of the sumofdigits function in number fields
[pdf]
(with Jörg M. Thuswaldner).
Canadian Mathematical Bulletin 42:6877, 1999.

Convergence of branching processes to the local time of a Bessel process
[pdf].
Random Structures and Algorithms 13:423438, 1998.

The dying Fibonacci tree
[pdf].
In Applications of Fibonacci Numbers, G. E. Bergum et al. (eds.),
Volume 7, 145152, Kluwer 1998.

On the number of predecessors in constrained random mappings
[pdf].
Statistics and Probability Letters 36:2934, 1997.

On the profile of random trees
[pdf]
(with Michael Drmota).
Random Structures and Algorithms 10:421451, 1997.
Back to homepage