Constructing Small Tree Grammars and Small Circuits for Formulas. - Danny Hucke; Markus Lohrey; Eric Noeth (FSTTCS, 2014)

Querying Regular Languages over Sliding Windows. - Moses Ganardi; Danny Hucke; Markus Lohrey (FSTTCS, 2016)

The Smallest Grammar Problem Revisited. - Danny Hucke; Markus Lohrey; Carl Philipp Reh (SPIRE, 2016)

Universal tree source coding using grammar-based compression. - Danny Hucke; Markus Lohrey (ISIT, 2017)

Circuit Evaluation for Finite Semirings. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey (STACS, 2017)

Querying languages over sliding windows. - Moses Ganardi; Danny Hucke; Markus Lohrey (CoRR, 2017)

Approximation ratio of RePair. - Danny Hucke; Artur Jez; Markus Lohrey (CoRR, 2017)

Constructing small tree grammars and small circuits for formulas. - Moses Ganardi; Danny Hucke; Artur Jez; Markus Lohrey; Eric Noeth (J. Comput. Syst. Sci., 2017)

Randomized Sliding Window Algorithms for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey (ICALP, 2018)

Sliding Window Algorithms for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey (LATA, 2018)

Automata Theory on Sliding Windows. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey; Konstantinos Mamouras (STACS, 2018)

Tree Compression Using String Grammars. - Moses Ganardi; Danny Hucke; Markus Lohrey; Eric Noeth (Algorithmica, 2018)

Circuits and Expressions over Finite Semirings. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey (ACM Trans. Comput. Theory, 2018)

Derandomization for Sliding Window Algorithms with Strict Correctness. - Moses Ganardi; Danny Hucke; Markus Lohrey (CSR, 2019)

Sliding Window Property Testing for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey; Tatiana Starikovskaya (ISAAC, 2019)

Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. - Danny Hucke (SPIRE, 2019)

Universal Tree Source Coding Using Grammar-Based Compression. - Moses Ganardi; Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (IEEE Trans. Inf. Theory, 2019)

Grammar-based compression for strings and trees. - Danny Hucke (2019)

A Comparison of Empirical Tree Entropies. - Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (SPIRE, 2020)

Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. - Danny Hucke; Carl Philipp Reh (Algorithms, 2021)

Derandomization for Sliding Window Algorithms with Strict Correctness∗. - Moses Ganardi; Danny Hucke; Markus Lohrey (Theory Comput. Syst., 2021)

The Smallest Grammar Problem Revisited. - Hideo Bannai; Momoko Hirayama; Danny Hucke; Shunsuke Inenaga; Artur Jez; Markus Lohrey; Carl Philipp Reh (IEEE Trans. Inf. Theory, 2021)

Entropy Bounds for Grammar-Based Tree Compressors. - Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (IEEE Trans. Inf. Theory, 2021)

Regular Languages in the Sliding Window Model. - Moses Ganardi; Danny Hucke; Markus Lohrey; Konstantinos Mamouras; Tatiana Starikovskaya (TheoretiCS, 2025)