Benjamin Hackl

MaRDI QIDQ505695zbMATH OpenDBLPORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A computer algebra package for bivariate asymptotics with effective error bounds Theoretical Computer Science	2026-06-26	Paper
Binomial sums and Mellin asymptotics with explicit error bounds: a case study	2026-01-30	Paper
Rigorous analytic combinatorics in several variables in SageMath Séminaire Lotharingien de Combinatoire	2025-09-24	Paper
Pop-stack sorting and its image: permutations with overlapping runs Acta Mathematica Universitatis Comenianae. New Series	2024-10-18	Paper
Uncovering a random tree	2024-05-14	Paper
Down-step statistics in generalized Dyck paths Discrete Mathematics & Theoretical Computer Science	2023-05-30	Paper
Flip-sort and combinatorial aspects of pop-stack sorting (available as arXiv preprint)	2022-05-10	Paper
Flip-sort and combinatorial aspects of pop-stack sorting	2022-05-10	Paper
Counting ascents in generalized Dyck paths (available as arXiv preprint)	2021-06-15	Paper
A combinatorial identity for rooted labeled forests Aequationes Mathematicae	2020-03-25	Paper
Flip-sort and combinatorial aspects of pop-stack sorting (available as arXiv preprint)	2020-03-10	Paper
Reducing simply generated trees by iterative leaf cutting 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-18	Paper
Iterative cutting and pruning of planar trees 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-17	Paper
A hypergeometric proof for a binomial identity related to 1/\pi	2019-07-18	Paper
The register function and reductions of binary trees and lattice paths (available as arXiv preprint)	2019-04-29	Paper
The necklace process: a generating function approach Statistics & Probability Letters	2019-02-20	Paper
Growing and destroying Catalan-Stanley trees (available as arXiv preprint)	2018-12-10	Paper
Growing and destroying Catalan-Stanley trees	2018-12-10	Paper
Fringe analysis of plane trees related to cutting and pruning Aequationes Mathematicae	2018-04-10	Paper
Reductions of binary trees and lattice paths induced by the register function Theoretical Computer Science	2017-11-16	Paper
Analysis of bidirectional ballot sequences and random walks ending in their maximum Annals of Combinatorics	2017-01-26	Paper

Research outcomes over time

This page was built for person: Benjamin Hackl