| Pop-stack sorting and its image: Permutations with overlapping runs A Asinowski, C Banderier, S Billey, B Hackl, S Linusson Acta Mathematica Universitatis Comenianae 88 (3), 395-402, 2019 | 23 | 2019 |
| Flip-sort and combinatorial aspects of pop-stack sorting A Asinowski, C Banderier, B Hackl Discrete Mathematics & Theoretical Computer Science 22 (Special issues), 2021 | 20 | 2021 |
| Analysis of Bidirectional Ballot Sequences and Random Walks Ending in Their Maximum B Hackl, C Heuberger, H Prodinger, S Wagner Annals of Combinatorics 20 (4), 775-797, 2016 | 14 | 2016 |
| Ascents in Non-Negative Lattice Paths B Hackl, C Heuberger, H Prodinger arXiv preprint arXiv:1801.02996, 2018 | 11 | 2018 |
| Asymptotic expansions in SageMath B Hackl, C Heuberger, D Krenn | 9 | |
| Down-step statistics in generalized Dyck paths A Asinowski, B Hackl, SJ Selkirk Discrete Mathematics & Theoretical Computer Science 24 (Combinatorics), 2022 | 7 | 2022 |
| Fringe analysis of plane trees related to cutting and pruning B Hackl, C Heuberger, S Kropf, H Prodinger Aequationes mathematicae 92 (2), 311-353, 2018 | 5 | 2018 |
| Counting Ascents in Generalized Dyck Paths B Hackl, C Heuberger, H Prodinger 29th International Conference on Probabilistic, Combinatorial and Asymptotic …, 2018 | 4 | 2018 |
| Reductions of binary trees and lattice paths induced by the register function B Hackl, C Heuberger, H Prodinger Theoretical Computer Science 705, 31-57, 2018 | 4 | 2018 |
| Growing and Destroying Catalan-Stanley Trees H Prodinger, B Hackl Discrete Mathematics & Theoretical Computer Science 20, 2018 | 3* | 2018 |
| D1. 1: SWOT analysis of existing PUF security modules I Schaumüller-Bichl, A Kolberger, M Deutschmann, C Heuberger, ... CODES Project, July, 2013 | 3 | 2013 |
| The uncover process for random labeled trees B Hackl, A Panholzer, S Wagner La Matematica 2 (4), 861-892, 2023 | 2 | 2023 |
| Uncovering a Random Tree B Hackl, A Panholzer, S Wagner 33rd International Conference on Probabilistic, Combinatorial and Asymptotic …, 2022 | 2 | 2022 |
| On extremal cases of pop-stack sorting A Asinowski, C Banderier, B Hackl Proceedings of Permutation Patterns (Zürich, Switzerland), 33-37, 2019 | 2 | 2019 |
| A combinatorial identity for rooted labeled forests B Hackl Aequationes mathematicae 94 (2), 253-257, 2020 | 1 | 2020 |
| Reducing Simply Generated Trees by Iterative Leaf Cutting B Hackl, C Heuberger, S Wagner 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and …, 2019 | 1 | 2019 |
| The necklace process: A generating function approach B Hackl, H Prodinger Statistics & Probability Letters 142, 57-61, 2018 | 1 | 2018 |
| Iterative cutting and pruning of planar trees B Hackl, S Kropf, H Prodinger 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and …, 2017 | 1 | 2017 |
| The register function and reductions of binary trees and lattice paths B Hackl, C Heuberger, H Prodinger arXiv preprint arXiv:1602.06200, 2016 | 1 | 2016 |
| Binomial sums and Mellin asymptotics with explicit error bounds: a case study B Hackl, S Wagner arXiv preprint arXiv:2403.09408, 2024 | | 2024 |
Helmut ProdingerProfessor, Stellenbosch UniversityVerified email at sun.ac.za
