Publications

Published

  1. Andrei Asinowski, Cyril Banderier, and Benjamin Hackl, On Extremal Cases of Pop-Stack Sorting, in Proceedings of Permutation Patterns 2019 (Zurich, Switzerland), 2019, pp. 33–37.

  2. Benjamin Hackl, Clemens Heuberger, and Stephan Wagner, Reducing Simply Generated Trees by Iterative Leaf Cutting, in Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Philadelphia PA, 2019, pp. 36–44.

  3. Benjamin Hackl, Clemens Heuberger, Sara Kropf, and Helmut Prodinger, Fringe analysis of plane trees related to cutting and pruning, Aequationes Math., vol. 92, pp. 311–353, 2018. MR3773782.

  4. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, Reductions of binary trees and lattice paths induced by the register function, Theoret. Comput. Sci., vol. 705, pp. 31–57, 2018. MR3721457.

  5. Benjamin Hackl and Helmut Prodinger, The Necklace Process: A Generating Function Approach, Statist. Probab. Lett., vol. 142, pp. 57–61, 2018.

  6. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, Counting Ascents in Generalized Dyck Paths, in 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Dagstuhl, Germany, 2018, vol. 110, pp. 26:1–26:15.

  7. Benjamin Hackl and Helmut Prodinger, Growing and Destroying Catalan–Stanley Trees, Discrete Math. Theor. Comput. Sci., vol. 20, no. 1, 2018.

  8. Benjamin Hackl, Sara Kropf, and Helmut Prodinger, Iterative Cutting and Pruning of Planar Trees, in Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Philadelphia PA, 2017, pp. 66–72.

  9. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, The Register Function and Reductions of Binary Trees and Lattice Paths, in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.

  10. Benjamin Hackl, Clemens Heuberger, Helmut Prodinger, and Stephan Wagner, Analysis of Bidirectional Ballot Sequences and Random Walks Ending in their Maximum, Ann. Comb., vol. 20, pp. 775–797, 2016. MR3572386.

Accepted

  1. Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl, and Svante Linusson, Pop-stack sorting and its image: Permutations with overlapping runs. Accepted to Eurocomb 2019 (Bratislava, Slovakia), 2019.

  2. Benjamin Hackl, A Combinatorial Identity for Rooted Labelled Forests. To appear in Aequationes Mathematicae, 2019.

Preprint

  1. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, Ascents in Non-Negative Lattice Paths. arXiv:1801.02996 [math.CO], 2018.

Software

  1. Benjamin Hackl, Clemens Heuberger, and Daniel Krenn, Asymptotic Expansions in SageMath, module in SageMath 6.10. http://trac.sagemath.org/17601, 2015.

Short Notes, Technical Reports, and Other Publications

  1. Benjamin Hackl and Helmut Prodinger, A hypergeometric proof for a binomial identity related to 1/\pi. arXiv:1907.08680 [math.NT], 2019.

  2. Benjamin Hackl, Daniel Kurz, Clemens Heuberger, Jürgen Pilz, and Martin Deutschmann, A Statistical Noise Model for a Class of Physically Unclonable Functions. arXiv:1409.8137 [stat.AP], 2014.

Theses