Benjamin Hackl

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 13

Top Topics

Pruning Algorithms

Top Venues

Discret. Math. Theor. Comput. Sci.

Publications

Benjamin Hackl, Stephan G. Wagner
Binomial sums and Mellin asymptotics with explicit error bounds: a case study. CoRR (2024)
Benjamin Hackl, Stephan Wagner
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. AofA (2024)
Benjamin Hackl, Andrew Luo, Stephen Melczer, Jesse Selover, Elaine Wong
Rigorous Analytic Combinatorics in Several Variables in SageMath. CoRR (2023)
Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk
Down-step statistics in generalized Dyck paths. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Benjamin Hackl, Alois Panholzer, Stephan Wagner
Uncovering a Random Tree. AofA (2022)
Andrei Asinowski, Cyril Banderier, Benjamin Hackl
Flip-sort and combinatorial aspects of pop-stack sorting. Discret. Math. Theor. Comput. Sci. 22 (2) (2021)
Andrei Asinowski, Cyril Banderier, Benjamin Hackl
Flip-sort and combinatorial aspects of pop-stack sorting. CoRR (2020)
Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk
Down-step statistics in generalized Dyck paths. CoRR (2020)
Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner
Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO (2019)
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
Counting Ascents in Generalized Dyck Paths. AofA (2018)
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
Reductions of binary trees and lattice paths induced by the register function. Theor. Comput. Sci. 705 (2018)
Benjamin Hackl, Helmut Prodinger
Growing and Destroying Catalan-Stanley Trees. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Benjamin Hackl, Sara Kropf, Helmut Prodinger
Iterative Cutting and Pruning of Planar Trees. ANALCO (2017)
Benjamin Hackl
Methods for Reliable Topology Changes for Perimeter-Regularized Geometric Inverse Problems. SIAM J. Numer. Anal. 45 (5) (2007)