Michael Wallner

CoRR, 2023

2022

Enumeration of d-Combining Tree-Child Networks.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Compacted binary trees admit a stretched exponential.

[BibT_eX]

[DOI]

Andrew Elvey Price

Wenjie Fang

J. Comb. Theory, Ser. A, 2021

2020

Asymptotic enumeration of compacted binary trees of bounded right height.

[BibT_eX]

[DOI]

Antoine Genitrini

Manuel Kauers

J. Comb. Theory, Ser. A, 2020

A half-normal distribution scheme for generating functions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language.

[BibT_eX]

[DOI]

Andrew Elvey Price

Wenjie Fang

Proceedings of the 31st International Conference on Probabilistic, 2020

More Models of Walks Avoiding a Quadrant.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Proceedings of the 31st International Conference on Probabilistic, 2020

Latticepathology and Symmetric Functions (Extended Abstract).

[BibT_eX]

[DOI]

Marie-Louise Lackner

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

A bijection of plane increasing trees with relaxed binary trees of right height at most one.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux.

[BibT_eX]

[DOI]

CoRR, 2019

Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models.

[BibT_eX]

[DOI]

Cédric Chauve

Yann Ponty

CoRR, 2019

The Tu-Deng Conjecture holds Almost Surely.

[BibT_eX]

[DOI]

Lukas Spiegelhofer

Electron. J. Comb., 2019

Combinatorics of nondeterministic walks of the Dyck and Motzkin type.

[BibT_eX]

[DOI]

Elie de Panafieu

Mohamed Lamine Lamali

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

On the shape of random Pólya structures.

[BibT_eX]

[DOI]

Emma Yu Jin

Discret. Math., 2018

Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version).

[BibT_eX]

[DOI]

CoRR, 2018

Local time for lattice paths and the associated limit laws.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Rectangular Young tableaux with local decreases and the density method for uniform random generation.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Periodic Pólya Urns and an Application to Young Tableaux.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Lattice paths with catastrophes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Asymptotic Enumeration of Compacted Binary Trees.

[BibT_eX]

[DOI]

Antoine Genitrini

Manuel Kauers

CoRR, 2017

A note on the scaling limits of random Pólya trees.

[BibT_eX]

[DOI]

Emma Yu Jin

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

A half-normal distribution scheme for generating functions and the unexpected behavior of Motzkin paths.

[BibT_eX]

[DOI]

CoRR, 2016

Lattice paths below a line of rational slope.

[BibT_eX]

[DOI]

CoRR, 2016

Some reflections on directed lattice paths.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Lattice paths of slope 2/5.

[BibT_eX]

[DOI]