| 2026 | ICALP | Transducers on Compressed Strings. | Mikolaj Bojanczyk, Markus Lohrey |
| 2026 | MFCS | Distinguishing Elements in Semigroups. | Markus Lohrey, Alexander Thumm, Julio Xochitemol |
| 2026 | STACS | On the Complexity of Computing Strahler Numbers. | Moses Ganardi, Markus Lohrey |
| 2026 | WALCOM | Streaming Algorithms for Products of Probabilities. | Markus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol |
| 2025 | COCOON | Finding Cycle Types in Permutation Groups with Few Generators. | Markus Lohrey, Andreas Rosowski |
| 2025 | MFCS | FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. | Markus Lohrey, Sebastian Maneth, Markus L. Schmid |
| 2024 | CiE | Membership Problems in Infinite Groups. | Markus Lohrey |
| 2024 | MFCS | Streaming in Graph Products. | Markus Lohrey, Julio Xochitemol |
| 2023 | ICALP | On the Complexity of Diameter and Related Problems in Permutation Groups. | Markus Lohrey, Andreas Rosowski |
| 2022 | ISSAC | Exponent Equations in HNN-extensions. | Michael Figelius, Markus Lohrey |
| 2022 | MFCS | Streaming Word Problems. | Markus Lohrey, Lukas Lck |
| 2022 | MFCS | Membership Problems in Finite Groups. | Markus Lohrey, Andreas Rosowski, Georg Zetzsche |
| 2021 | CiE | Compression Techniques in Group Theory. | Markus Lohrey |
| 2021 | FCT | Complexity of Word Problems for HNN-Extensions. | Markus Lohrey |
| 2021 | STACS | Subgroup Membership in GL(2, Z). | Markus Lohrey |
| 2020 | CiE | Balancing Straight-Line Programs for Strings and Trees. | Markus Lohrey |
| 2020 | ICALP | The Complexity of Knapsack Problems in Wreath Products. | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
| 2020 | MFCS | Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. | Markus Lohrey, Georg Zetzsche |
| 2020 | SPIRE | A Comparison of Empirical Tree Entropies. | Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner |
| 2019 | CSR | Derandomization for Sliding Window Algorithms with Strict Correctness. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2019 | DSD | Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems. | Seungbum Jo, Markus Lohrey, Simon Meckel, Roman Obermaisser, Simon Plasger |
| 2019 | FCT | Largest Common Prefix of a Regular Tree Language. | Markus Lohrey, Sebastian Maneth |
| 2019 | FOCS | Balancing Straight-Line Programs. | Moses Ganardi, Artur Jez, Markus Lohrey |
| 2019 | ISAAC | Sliding Window Property Testing for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya |
| 2019 | ISIT | Entropy Bounds for Grammar-Based Tree Compressors. | Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner |
| 2019 | MFCS | The Power Word Problem. | Markus Lohrey, Armin Wei |
| 2019 | STACS | Compressed Decision Problems in Hyperbolic Groups. | Derek F. Holt, Markus Lohrey, Saul Schleimer |
| 2018 | CSR | Grammar-Based Compression of Unranked Trees. | Adri Gascn, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber |
| 2018 | ICALP | Randomized Sliding Window Algorithms for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | LATA | Sliding Window Algorithms for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | MFCS | Average Case Analysis of Leaf-Centric Binary Tree Sources. | Louisa Seelbach Benkner, Markus Lohrey |
| 2018 | MFCS | Sliding Windows over Context-Free Languages. | Moses Ganardi, Artur Jez, Markus Lohrey |
| 2018 | STACS | Automata Theory on Sliding Windows. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey, Konstantinos Mamouras |
| 2018 | STACS | Knapsack Problems for Wreath Products. | Moses Ganardi, Daniel Knig, Markus Lohrey, Georg Zetzsche |
| 2017 | DSD | An Architecture for Online-Diagnosis Systems Supporting Compressed Communication. | Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger |
| 2017 | ICDT | Compression of Unordered XML Trees. | Markus Lohrey, Sebastian Maneth, Carl Philipp Reh |
| 2017 | ISIT | Universal tree source coding using grammar-based compression. | Danny Hucke, Markus Lohrey |
| 2017 | LICS | Computing quantiles in Markov chains with multi-dimensional costs. | Christoph Haase, Stefan Kiefer, Markus Lohrey |
| 2017 | MFCS | Counting Problems for Parikh Images. | Christoph Haase, Stefan Kiefer, Markus Lohrey |
| 2017 | STACS | Circuit Evaluation for Finite Semirings. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey |
| 2017 | STACS | The Complexity of Knapsack in Graph Groups. | Markus Lohrey, Georg Zetzsche |
| 2016 | CSL | On the Parallel Complexity of Bisimulation on Finite Systems. | Moses Ganardi, Stefan Gller, Markus Lohrey |
| 2016 | DCC | Traversing Grammar-Compressed Trees with Constant Delay. | Markus Lohrey, Sebastian Maneth, Carl Philipp Reh |
| 2016 | LATIN | Tree Compression Using String Grammars. | Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth |
| 2016 | STACS | Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. | Markus Lohrey, Georg Zetzsche |
| 2016 | SPIRE | The Smallest Grammar Problem Revisited. | Danny Hucke, Markus Lohrey, Carl Philipp Reh |
| 2015 | COCOON | Evaluating Matrix Circuits. | Daniel Knig, Markus Lohrey |
| 2015 | CSL | Temporal Logics with Local Constraints (Invited Talk). | Claudia Carapelle, Markus Lohrey |
| 2015 | CSR | Satisfiability of ECTL* with Tree Constraints. | Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey |
| 2015 | DLT | Path Checking for MTL and TPTL over Data Words. | Shiguang Feng, Markus Lohrey, Karin Quaas |
| 2015 | DLT | Grammar-Based Tree Compression. | Markus Lohrey |
| 2015 | ICALP | Compressed Tree Canonization. | Markus Lohrey, Sebastian Maneth, Fabian Peternek |
| 2015 | MFCS | Parallel Identity Testing for Skew Circuits with Big Powers and Applications. | Daniel Knig, Markus Lohrey |
| 2014 | CSR | Processing Succinct Matrices and Vectors. | Markus Lohrey, Manfred Schmidt-Schau |
| 2014 | STACS | Approximation of smallest linear tree grammar. | Artur Jez, Markus Lohrey |
| 2014 | STACS | On Boolean closed full trios and rational Kripke frames. | Markus Lohrey, Georg Zetzsche |
| 2013 | CONCUR | Satisfiability of CTL* with Constraints. | Claudia Carapelle, Alexander Kartzow, Markus Lohrey |
| 2013 | ICALP | Rational Subsets and Submonoids of Wreath Products. | Markus Lohrey, Benjamin Steinberg, Georg Zetzsche |
| 2013 | ICDT | XML compression via DAGs. | Markus Lohrey, Sebastian Maneth, Eric Noeth |
| 2012 | CiE | Tree-Automatic Well-Founded Trees. | Alexander Kartzow, Jiamou Liu, Markus Lohrey |
| 2012 | LATIN | Logspace Computations in Graph Groups and Coxeter Groups. | Volker Diekert, Jonathan Kausch, Markus Lohrey |
| 2012 | LICS | The Complexity of Decomposing Modal and First-Order Theories. | Stefan Gller, Jean Christoph Jung, Markus Lohrey |
| 2011 | CSR | Compressed Membership in Automata with Compressed Labels. | Markus Lohrey, Christian Mathissen |
| 2011 | DCC | Tree Structure Compression with RePair. | Markus Lohrey, Sebastian Maneth, Roy Mennicke |
| 2011 | ICALP | Isomorphism of Regular Trees and Words. | Markus Lohrey, Christian Mathissen |
| 2011 | MFCS | Compressed Word Problems for Inverse Monoids. | Markus Lohrey |
| 2010 | CSL | The Isomorphism Problem for | Dietrich Kuske, Jiamou Liu, Markus Lohrey |
| 2010 | DLT | Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. | Niko Haubold, Markus Lohrey, Christian Mathissen |
| 2010 | LICS | The Isomorphism Problem on Classes of Automatic Structures. | Dietrich Kuske, Jiamou Liu, Markus Lohrey |
| 2010 | STACS | Branching-time Model Checking of One-counter Processes. | Stefan Gller, Markus Lohrey |
| 2009 | CSL | Automatic Structures of Bounded Degree Revisited. | Dietrich Kuske, Markus Lohrey |
| 2009 | CSR | Compressed Word Problems in HNN-Extensions and Amalgamated Products. | Niko Haubold, Markus Lohrey |
| 2009 | FOSSACS | Parameter Reduction in Grammar-Compressed Trees. | Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schau |
| 2007 | CSR | Efficient Computation in Groups Via Compression. | Markus Lohrey, Saul Schleimer |
| 2007 | FOSSACS | PDL with Intersection and Converse Is 2 EXP-Complete. | Stefan Gller, Markus Lohrey, Carsten Lutz |
| 2007 | LATA | The submonoid and rational subset membership problems for graph groups. | Markus Lohrey, Benjamin Steinberg |
| 2006 | CSL | Infinite State Model-Checking of Propositional Dynamic Logics. | Stefan Gller, Markus Lohrey |
| 2006 | FOSSACS | First-Order and Counting Theories of | Dietrich Kuske, Markus Lohrey |
| 2006 | ICALP | Theories of HNN-Extensions and Amalgamated Products. | Markus Lohrey, Graud Snizergues |
| 2006 | LICS | Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. | Dietrich Kuske, Markus Lohrey |
| 2006 | MFCS | Partially Commutative Inverse Monoids. | Volker Diekert, Markus Lohrey, Alexander Miller |
| 2006 | MFCS | Querying and Embedding Compressed Texts. | Yury Lifshits, Markus Lohrey |
| 2005 | LICS | Model-Checking Hierarchical Structures. | Markus Lohrey |
| 2005 | MFCS | Inverse Monoids: Decidability and Complexity of Algebraic Questions. | Markus Lohrey, Nicole Ondrusch |
| 2004 | DLT | Decidability and Complexity in Automatic Monoids. | Markus Lohrey |
| 2004 | ICALP | Word Problems on Compressed Words. | Markus Lohrey |
| 2003 | LPAR | Automatic Structures of Bounded Degree. | Markus Lohrey |
| 2003 | STACS | Decidable Theories of Cayley-Graphs. | Dietrich Kuske, Markus Lohrey |
| 2002 | CONCUR | Safe Realizability of High-Level Message Sequence Charts. | Markus Lohrey |
| 2002 | FOSSACS | Bounded MSC Communication. | Markus Lohrey, Anca Muscholl |
| 2002 | ICALP | On the Theory of One-Step Rewriting in Trace Monoids. | Dietrich Kuske, Markus Lohrey |
| 2002 | ICALP | Axiomatising Divergence. | Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns |
| 2002 | STACS | Existential and Positive Theories of Equations in Graph Products. | Volker Diekert, Markus Lohrey |
| 2001 | MFCS | Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. | Markus Lohrey |
| 1999 | MFCS | Complexity Results for Confluence Problems. | Markus Lohrey |
| 1998 | CONCUR | Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). | Holger Hermanns, Markus Lohrey |