Average Case Analysis of Leaf-Centric Binary Tree Sources. - Louisa Seelbach Benkner; Markus Lohrey (MFCS, 2018)

Tunneling on Wheeler Graphs. - Jarno N. Alanko; Travis Gagie; Gonzalo Navarro 001; Louisa Seelbach Benkner (DCC, 2019)

Tree-Shape Grammars for Random Access. - Travis Gagie; Tomohiro I; Giovanni Manzini; Gonzalo Navarro 001; Hiroshi Sakamoto; Louisa Seelbach Benkner; Yoshimasa Takabatake (CoRR, 2019)

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

On the Collection of Fringe Subtrees in Random Binary Trees. - Louisa Seelbach Benkner; Stephan G. Wagner (LATIN, 2020)

Practical Random Access to SLP-Compressed Texts. - Travis Gagie; Tomohiro I; Giovanni Manzini; Gonzalo Navarro 001; Hiroshi Sakamoto; Louisa Seelbach Benkner; Yoshimasa Takabatake (SPIRE, 2020)

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

Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. - J. Ian Munro; Patrick K. Nicholson; Louisa Seelbach Benkner; Sebastian Wild (ESA, 2021)

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. - J. Ian Munro; Patrick K. Nicholson; Louisa Seelbach Benkner; Sebastian Wild (CoRR, 2021)

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

Distinct Fringe Subtrees in Random Trees. - Louisa Seelbach Benkner; Stephan G. Wagner (Algorithmica, 2022)

Combinatorial and information-theoretic aspects of tree compression. - Louisa Seelbach Benkner (2023)

Upper Bounds on the Average Height of Random Binary Trees. - Louisa Seelbach Benkner (CoRR, 2024)

Streaming algorithms for products of probabilities. - Markus Lohrey; Leon Rische; Louisa Seelbach Benkner; Julio Xochitemol (CoRR, 2025)