Hackl, Benjamin; Wagner, Stephan Binomial sums and Mellin asymptotics with explicit error bounds: a case study. arXiv:2403.09408 Preprint, arXiv:2403.09408 [math.CO] (2024). MSC: 05A15 05A16 05-04 BibTeX Cite \textit{B. Hackl} and \textit{S. Wagner}, ``Binomial sums and Mellin asymptotics with explicit error bounds: a case study'', Preprint, arXiv:2403.09408 [math.CO] (2024) Full Text: arXiv OA License
Hackl, Benjamin; Panholzer, Alois; Wagner, Stephan The uncover process for random labeled trees. (English) Zbl 07782552 Matematica 2, No. 4, 861-892 (2023). MSC: 05C80 05C78 05C05 60C05 60F05 60F17 PDFBibTeX XMLCite \textit{B. Hackl} et al., Matematica 2, No. 4, 861--892 (2023; Zbl 07782552) Full Text: DOI arXiv OA License
Asinowski, Andrei; Hackl, Benjamin; Selkirk, Sarah J. Down-step statistics in generalized Dyck paths. (English) Zbl 1519.05012 Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 17, 40 p. (2022). MSC: 05A15 94B10 PDFBibTeX XMLCite \textit{A. Asinowski} et al., Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 17, 40 p. (2022; Zbl 1519.05012) Full Text: DOI arXiv
Asinowski, Andrei; Banderier, Cydril; Hackl, Benjamin Flip-sort and combinatorial aspects of pop-stack sorting. (English) Zbl 07524066 Discrete Math. Theor. Comput. Sci. 22(2021-2023), No. 2, Paper No. 4, 39 p. (2021). MSC: 68P10 05A05 05A15 68Q45 68R05 PDFBibTeX XMLCite \textit{A. Asinowski} et al., Discrete Math. Theor. Comput. Sci. 22, No. 2, Paper No. 4, 39 p. (2021; Zbl 07524066) Full Text: arXiv Link
Hackl, Benjamin A combinatorial identity for rooted labeled forests. (English) Zbl 1435.05033 Aequationes Math. 94, No. 2, 253-257 (2020). MSC: 05A19 05A18 05C05 PDFBibTeX XMLCite \textit{B. Hackl}, Aequationes Math. 94, No. 2, 253--257 (2020; Zbl 1435.05033) Full Text: DOI arXiv
Hackl, Benjamin; Heuberger, Clemens; Wagner, Stephan Reducing simply generated trees by iterative leaf cutting. (English) Zbl 1433.05075 Mishna, Marni (ed.) et al., Proceedings of the 16th workshop on analytic algorithmics and combinatorics, ANALCO ’19, San Diego, CA, USA, January 6, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 36-44 (2019). MSC: 05C05 PDFBibTeX XMLCite \textit{B. Hackl} et al., in: Proceedings of the 16th workshop on analytic algorithmics and combinatorics, ANALCO '19, San Diego, CA, USA, January 6, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 36--44 (2019; Zbl 1433.05075) Full Text: DOI arXiv
Hackl, Benjamin; Heuberger, Clemens; Prodinger, Helmut Counting ascents in generalized Dyck paths. (English) Zbl 1482.05012 Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018). MSC: 05A15 PDFBibTeX XMLCite \textit{B. Hackl} et al., LIPIcs -- Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018; Zbl 1482.05012) Full Text: DOI arXiv
Hackl, Benjamin; Prodinger, Helmut The necklace process: a generating function approach. (English) Zbl 1407.60016 Stat. Probab. Lett. 142, 57-61 (2018). MSC: 60C05 05A15 05A16 PDFBibTeX XMLCite \textit{B. Hackl} and \textit{H. Prodinger}, Stat. Probab. Lett. 142, 57--61 (2018; Zbl 1407.60016) Full Text: DOI arXiv
Hackl, Benjamin; Prodinger, Helmut Growing and destroying Catalan-Stanley trees. (English) Zbl 1401.05147 Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 11, 14 p. (2018). MSC: 05C30 05C05 05A16 05C10 05A15 PDFBibTeX XMLCite \textit{B. Hackl} and \textit{H. Prodinger}, Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 11, 14 p. (2018; Zbl 1401.05147) Full Text: arXiv Link
Hackl, Benjamin; Heuberger, Clemens; Kropf, Sara; Prodinger, Helmut Fringe analysis of plane trees related to cutting and pruning. (English) Zbl 1383.05017 Aequationes Math. 92, No. 2, 311-353 (2018). MSC: 05A16 05C05 05C10 05A15 05A19 60C05 PDFBibTeX XMLCite \textit{B. Hackl} et al., Aequationes Math. 92, No. 2, 311--353 (2018; Zbl 1383.05017) Full Text: DOI arXiv
Hackl, Benjamin; Heuberger, Clemens; Prodinger, Helmut Reductions of binary trees and lattice paths induced by the register function. (English) Zbl 1380.68305 Theor. Comput. Sci. 705, 31-57 (2018). MSC: 68R05 05A10 05A15 05A16 PDFBibTeX XMLCite \textit{B. Hackl} et al., Theor. Comput. Sci. 705, 31--57 (2018; Zbl 1380.68305) Full Text: DOI arXiv
Hackl, Benjamin; Kropf, Sara; Prodinger, Helmut Iterative cutting and pruning of planar trees. (English) Zbl 1433.05076 Martínez, Conrado (ed.) et al., Proceedings of the 14th workshop on analytic algorithmics and combinatorics, ANALCO ’17, Barcelona, Spain, January 16–17, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 66-72 (2017). MSC: 05C05 05C10 05C76 PDFBibTeX XMLCite \textit{B. Hackl} et al., in: Proceedings of the 14th workshop on analytic algorithmics and combinatorics, ANALCO '17, Barcelona, Spain, January 16--17, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 66--72 (2017; Zbl 1433.05076) Full Text: DOI
Hackl, Benjamin; Heuberger, Clemens; Prodinger, Helmut The register function and reductions of binary trees and lattice paths. (English) Zbl 1409.05022 Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016). MSC: 05A16 05A15 68P05 68R05 60C05 05C05 PDFBibTeX XMLCite \textit{B. Hackl} et al., in: Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms -- AofA'16, Kraków, Poland, July 4--8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016; Zbl 1409.05022) Full Text: arXiv
Hackl, Benjamin; Heuberger, Clemens; Prodinger, Helmut; Wagner, Stephan Analysis of bidirectional ballot sequences and random walks ending in their maximum. (English) Zbl 1358.05019 Ann. Comb. 20, No. 4, 775-797 (2016). Reviewer: Ljuben Mutafchiev (Sofia) MSC: 05A16 05A15 05A10 60C05 60G50 PDFBibTeX XMLCite \textit{B. Hackl} et al., Ann. Comb. 20, No. 4, 775--797 (2016; Zbl 1358.05019) Full Text: DOI arXiv