default search action
Danny Hucke
Person information
- affiliation: Universität Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya:
Regular Languages in the Sliding Window Model. CoRR abs/2402.13385 (2024) - 2021
- [j8]Danny Hucke, Carl Philipp Reh:
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. Algorithms 14(2): 65 (2021) - [j7]Moses Ganardi
, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness∗. Theory Comput. Syst. 65(3): 1-18 (2021) - [j6]Hideo Bannai
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67(1): 317-328 (2021) - [j5]Danny Hucke, Markus Lohrey
Entropy Bounds for Grammar-Based Tree Compressors. IEEE Trans. Inf. Theory 67(11): 7596-7615 (2021) - 2020
- [c14]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. SPIRE 2020: 232-246 - [i11]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. CoRR abs/2006.01695 (2020)
2010 – 2019
- 2019
- [b1]Danny Hucke:
Grammar-based compression for strings and trees. University of Siegen, Germany, 2019 - [j4]Moses Ganardi, Danny Hucke, Markus Lohrey
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65(10): 6399-6413 (2019) - [c13]Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness. CSR 2019: 237-249 - [c12]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding Window Property Testing for Regular Languages. ISAAC 2019: 6:1-6:13 - [c11]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. ISIT 2019: 1687-1691 - [c10]Danny Hucke:
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. SPIRE 2019: 3-15 - [i10]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. CoRR abs/1901.03155 (2019) - [i9]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The smallest grammar problem revisited. CoRR abs/1908.06428 (2019) - [i8]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding window property testing for regular languages. CoRR abs/1909.10261 (2019) - 2018
- [j3]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. Algorithmica 80(3): 885-917 (2018) - [j2]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuits and Expressions over Finite Semirings. ACM Trans. Comput. Theory 10(4): 15:1-15:30 (2018) - [c9]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized Sliding Window Algorithms for Regular Languages. ICALP 2018: 127:1-127:13 - [c8]Moses Ganardi, Danny Hucke, Markus Lohrey:
Sliding Window Algorithms for Regular Languages. LATA 2018: 26-35 - [c7]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras:
Automata Theory on Sliding Windows. STACS 2018: 31:1-31:14 - [i7]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized sliding window algorithms for regular languages. CoRR abs/1802.07600 (2018) - 2017
- [j1]Moses Ganardi
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86: 136-158 (2017) - [c6]Danny Hucke, Markus Lohrey:
Universal tree source coding using grammar-based compression. ISIT 2017: 1753-1757 - [c5]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. STACS 2017: 35:1-35:14 - [i6]Danny Hucke, Markus Lohrey:
Universal Tree Source Coding Using Grammar-Based Compression. CoRR abs/1701.08785 (2017) - [i5]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying languages over sliding windows. CoRR abs/1702.04376 (2017) - [i4]Danny Hucke, Artur Jez, Markus Lohrey:
Approximation ratio of RePair. CoRR abs/1703.06061 (2017) - 2016
- [c4]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying Regular Languages over Sliding Windows. FSTTCS 2016: 18:1-18:14 - [c3]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. LATIN 2016: 590-604 - [c2]Danny Hucke, Markus Lohrey, Carl Philipp Reh:
The Smallest Grammar Problem Revisited. SPIRE 2016: 35-49 - [i3]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. CoRR abs/1602.04560 (2016) - 2015
- [i2]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree compression using string grammars. CoRR abs/1504.05535 (2015) - 2014
- [c1]Danny Hucke, Markus Lohrey, Eric Noeth:
Constructing Small Tree Grammars and Small Circuits for Formulas. FSTTCS 2014: 457-468 - [i1]Danny Hucke, Markus Lohrey, Eric Noeth:
Constructing small tree grammars and small circuits for formulas. CoRR abs/1407.4286 (2014)
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-04-25 05:53 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: