default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Hackl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Benjamin Hackl
, Stephan Wagner:
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. AofA 2024: 19:1-19:15- [i4]Benjamin Hackl, Stephan G. Wagner:
Binomial sums and Mellin asymptotics with explicit error bounds: a case study. CoRR abs/2403.09408 (2024) - 2023
- [i3]Benjamin Hackl, Andrew Luo, Stephen Melczer, Jesse Selover, Elaine Wong:
Rigorous Analytic Combinatorics in Several Variables in SageMath. CoRR abs/2303.09603 (2023) - 2022
- [j5]Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk:
Down-step statistics in generalized Dyck paths. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [c4]Benjamin Hackl, Alois Panholzer, Stephan Wagner:
Uncovering a Random Tree. AofA 2022: 10:1-10:17 - 2021
- [j4]Andrei Asinowski, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - 2020
- [i2]Andrei Asinowski, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. CoRR abs/2003.04912 (2020) - [i1]Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk:
Down-step statistics in generalized Dyck paths. CoRR abs/2007.15562 (2020)
2010 – 2019
- 2019
- [c3]Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner:
Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO 2019: 36-44 - 2018
- [j3]Benjamin Hackl, Helmut Prodinger:
Growing and Destroying Catalan-Stanley Trees. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j2]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Reductions of binary trees and lattice paths induced by the register function. Theor. Comput. Sci. 705: 31-57 (2018) - [c2]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Counting Ascents in Generalized Dyck Paths. AofA 2018: 26:1-26:15 - 2017
- [c1]Benjamin Hackl, Sara Kropf, Helmut Prodinger:
Iterative Cutting and Pruning of Planar Trees. ANALCO 2017: 66-72
2000 – 2009
- 2007
- [j1]Benjamin Hackl:
Methods for Reliable Topology Changes for Perimeter-Regularized Geometric Inverse Problems. SIAM J. Numer. Anal. 45(5): 2201-2227 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
