Benjamin Hackl

According to our database, Benjamin Hackl authored at least 11 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Binomial sums and Mellin asymptotics with explicit error bounds: a case study.

Benjamin Hackl, Stephan G. Wagner

CoRR, 2024

2023

Rigorous Analytic Combinatorics in Several Variables in SageMath.

Benjamin Hackl, Andrew Luo, Stephen Melczer, Jesse Selover, Elaine Wong

CoRR, 2023

2022

Down-step statistics in generalized Dyck paths.

Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk

Discret. Math. Theor. Comput. Sci., 2022

Uncovering a Random Tree.

Benjamin Hackl, Alois Panholzer, Stephan Wagner

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Flip-sort and combinatorial aspects of pop-stack sorting.

Andrei Asinowski, Cyril Banderier, Benjamin Hackl

Discret. Math. Theor. Comput. Sci., 2021

2019

Reducing Simply Generated Trees by Iterative Leaf Cutting.

Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Reductions of binary trees and lattice paths induced by the register function.

Benjamin Hackl, Clemens Heuberger, Helmut Prodinger

Theor. Comput. Sci., 2018

Growing and Destroying Catalan-Stanley Trees.

Benjamin Hackl, Helmut Prodinger

Discret. Math. Theor. Comput. Sci., 2018

Counting Ascents in Generalized Dyck Paths.

Benjamin Hackl, Clemens Heuberger, Helmut Prodinger

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Iterative Cutting and Pruning of Planar Trees.

Benjamin Hackl, Sara Kropf, Helmut Prodinger

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2007

Methods for Reliable Topology Changes for Perimeter-Regularized Geometric Inverse Problems.

Benjamin Hackl

SIAM J. Numer. Anal., 2007