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
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; 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