Michael Wallner

Orcid: 0000-0001-8581-449X

Affiliations:
  • TU Vienna, Austria


According to our database1, Michael Wallner authored at least 32 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Walks avoiding a quadrant and the reflection principle.
Eur. J. Comb., 2024

A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

Bijections between Variants of Dyck Paths and Integer Compositions.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

Asymptotics of relaxed <i>k</i>-ary trees.
CoRR, 2024

Enumerative and distributional results for d-combining tree-child networks.
Adv. Appl. Math., 2024

Asymptotics of Relaxed k-Ary Trees.
Proceedings of the 35th International Conference on Probabilistic, 2024

Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
Combinatorics of nondeterministic walks.
CoRR, 2023

2022
Enumeration of d-Combining Tree-Child Networks.
Proceedings of the 33rd International Conference on Probabilistic, 2022

2021
Compacted binary trees admit a stretched exponential.
J. Comb. Theory A, 2021

2020
Asymptotic enumeration of compacted binary trees of bounded right height.
J. Comb. Theory A, 2020

A half-normal distribution scheme for generating functions.
Eur. J. Comb., 2020

Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language.
Proceedings of the 31st International Conference on Probabilistic, 2020

More Models of Walks Avoiding a Quadrant.
Proceedings of the 31st International Conference on Probabilistic, 2020

Latticepathology and Symmetric Functions (Extended Abstract).
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.
Theor. Comput. Sci., 2019

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

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

The Tu-Deng Conjecture holds Almost Surely.
Electron. J. Comb., 2019

Combinatorics of nondeterministic walks of the Dyck and Motzkin type.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
On the shape of random Pólya structures.
Discret. Math., 2018

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

Local time for lattice paths and the associated limit laws.
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.
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.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Lattice paths with catastrophes.
Electron. Notes Discret. Math., 2017

Asymptotic Enumeration of Compacted Binary Trees.
CoRR, 2017

A note on the scaling limits of random Pólya trees.
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.
CoRR, 2016

Lattice paths below a line of rational slope.
CoRR, 2016

Some reflections on directed lattice paths.
CoRR, 2016

2015
Lattice paths of slope 2/5.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015


  Loading...