default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouisa Seelbach Benkner
Person information
- affiliation: Universität Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Louisa Seelbach Benkner:
Combinatorial and information-theoretic aspects of tree compression. University of Siegen, Germany, 2023
Journal Articles
- 2022
- [j3]Louisa Seelbach Benkner
, Stephan G. Wagner:
Distinct Fringe Subtrees in Random Trees. Algorithmica 84(12): 3686-3728 (2022) - 2021
- [j2]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. IEEE Trans. Inf. Theory 67(11): 7596-7615 (2021) - 2019
- [j1]Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65(10): 6399-6413 (2019)
Conference and Workshop Papers
- 2021
- [c7]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA 2021: 70:1-70:18 - 2020
- [c6]Louisa Seelbach Benkner, Stephan G. Wagner:
On the Collection of Fringe Subtrees in Random Binary Trees. LATIN 2020: 546-558 - [c5]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Practical Random Access to SLP-Compressed Texts. SPIRE 2020: 221-231 - [c4]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. SPIRE 2020: 232-246 - 2019
- [c3]Jarno N. Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner:
Tunneling on Wheeler Graphs. DCC 2019: 122-131 - [c2]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. ISIT 2019: 1687-1691 - 2018
- [c1]Louisa Seelbach Benkner, Markus Lohrey:
Average Case Analysis of Leaf-Centric Binary Tree Sources. MFCS 2018: 16:1-16:15
Informal and Other Publications
- 2024
- [i9]Louisa Seelbach Benkner:
Upper Bounds on the Average Height of Random Binary Trees. CoRR abs/2405.17952 (2024) - 2021
- [i8]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR abs/2104.13457 (2021) - [i7]Louisa Seelbach Benkner, Stephan G. Wagner:
Distinct Fringe Subtrees in Random Trees. CoRR abs/2105.04231 (2021) - 2020
- [i6]Louisa Seelbach Benkner, Stephan Wagner:
On the Collection of Fringe Subtrees in Random Binary Trees. CoRR abs/2003.03323 (2020) - [i5]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. CoRR abs/2006.01695 (2020) - 2019
- [i4]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. CoRR abs/1901.03155 (2019) - [i3]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Tree-Shape Grammars for Random Access. CoRR abs/1910.07145 (2019) - 2018
- [i2]Louisa Seelbach Benkner, Markus Lohrey:
Average Case Analysis of Leaf-Centric Binary Tree Sources. CoRR abs/1804.10396 (2018) - [i1]Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner:
Tunneling on Wheeler Graphs. CoRR abs/1811.02457 (2018)
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-06-25 21:50 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:
