Markus Lohrey

256 papers A* 12A 16B 39C 15Misc 8Journal 131Unranked 30
YearRankTypeTitle / Venue / Authors
2026 J jnl
MSO-Enumeration Over SLP-Compressed Unranked Forests.
TheoretiCS
Markus Lohrey, Markus L. Schmid
2026 A conf
On the Complexity of Computing Strahler Numbers.
STACS
Moses Ganardi, Markus Lohrey
2026 B conf
Streaming Algorithms for Products of Probabilities.
WALCOM
Markus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol
2025 B conf
FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree.
MFCS
Markus Lohrey, Sebastian Maneth, Markus L. Schmid
2025 J jnl
FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree.
CoRR
Markus Lohrey, Sebastian Maneth, Markus L. Schmid
2025 — conf
Finding Cycle Types in Permutation Groups with Few Generators.
COCOON (2)
Markus Lohrey, Andreas Rosowski
2025 J jnl
On the complexity of computing Strahler numbers.
CoRR
Moses Ganardi, Markus Lohrey
2025 J jnl
Parameterized Complexity of Factorization Problems.
Discret. Math. Theor. Comput. Sci.
Markus Lohrey, Andreas Rosowski
2025 J jnl
Regular Languages in the Sliding Window Model.
TheoretiCS
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya
2025 J jnl
Streaming algorithms for products of probabilities.
CoRR
Markus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol
2024 J jnl
Enumeration for MSO-Queries on Compressed Trees.
CoRR
Markus Lohrey, Markus L. Schmid
2024 J jnl
Enumeration for MSO-Queries on Compressed Trees.
Proc. ACM Manag. Data
Markus Lohrey, Markus L. Schmid
2024 C conf
Membership Problems in Infinite Groups.
CiE
Markus Lohrey
2024 J jnl
Regular Languages in the Sliding Window Model.
CoRR
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya
2024 B conf
Streaming in Graph Products.
MFCS
Markus Lohrey, Julio Xochitemol
2024 J jnl
Subgroup Membership in GL(2,Z).
Theory Comput. Syst.
Markus Lohrey
2024 J jnl
The Power Word Problem in Graph Products.
Theory Comput. Syst.
Markus Lohrey, Florian Stober, Armin Weiß
2023 J jnl
Complexity of word problems for HNN-extensions.
J. Comput. Syst. Sci.
Markus Lohrey
2023 J jnl
Knapsack and the power word problem in solvable Baumslag-Solitar groups.
Int. J. Algebra Comput.
Moses Ganardi, Markus Lohrey, Georg Zetzsche
2023 A* conf
On the Complexity of Diameter and Related Problems in Permutation Groups.
ICALP
Markus Lohrey, Andreas Rosowski
2022 B conf
Exponent Equations in HNN-extensions.
ISSAC
Michael Figelius, Markus Lohrey
2022 J jnl
Exponent equations in HNN-extensions.
Groups Complex. Cryptol.
Michael Figelius, Markus Lohrey
2022 J jnl
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems.
ACM Trans. Comput. Theory
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2022 — conf
Low-Latency Sliding Window Algorithms for Formal Languages.
FSTTCS
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
2022 J jnl
Low-Latency Sliding Window Algorithms for Formal Languages.
CoRR
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
2022 B conf
Membership Problems in Finite Groups.
MFCS
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
2022 J jnl
Membership Problems in Finite Groups.
CoRR
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
2022 B conf
Streaming Word Problems.
MFCS
Markus Lohrey, Lukas Lück
2022 J jnl
Streaming word problems.
CoRR
Markus Lohrey, Lukas Lück
2021 J jnl
Balancing Straight-line Programs.
J. ACM
Moses Ganardi, Artur Jez, Markus Lohrey
2021 B conf
Complexity of Word Problems for HNN-Extensions.
FCT
Markus Lohrey
2021 C conf
Compression Techniques in Group Theory.
CiE
Markus Lohrey
2021 J jnl
Derandomization for Sliding Window Algorithms with Strict Correctness
Theory Comput. Syst.
Moses Ganardi, Danny Hucke, Markus Lohrey
2021 J jnl
Entropy Bounds for Grammar-Based Tree Compressors.
IEEE Trans. Inf. Theory
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2021 J jnl
Largest common prefix of a regular tree language.
J. Comput. Syst. Sci.
Markus Lohrey, Sebastian Maneth
2021 A conf
Subgroup Membership in GL(2, Z).
STACS
Markus Lohrey
2021 J jnl
The Smallest Grammar Problem Revisited.
IEEE Trans. Inf. Theory
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2020 C conf
A Comparison of Empirical Tree Entropies.
SPIRE
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2020 J jnl
A Comparison of Empirical Tree Entropies.
CoRR
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2020 C conf
Balancing Straight-Line Programs for Strings and Trees.
CiE
Markus Lohrey
2020 J jnl
Combined compression of multiple correlated data streams for online-diagnosis systems.
Microprocess. Microsystems
Simon Meckel, Markus Lohrey, Seungbum Jo, Roman Obermaisser, Simon Plasger
2020 J jnl
Grammar-Based Compression of Unranked Trees.
Theory Comput. Syst.
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2020 A conf
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems.
CCC
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2020 B conf
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups.
MFCS
Markus Lohrey, Georg Zetzsche
2020 A* conf
The Complexity of Knapsack Problems in Wreath Products.
ICALP
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
2020 J jnl
The complexity of knapsack problems in wreath products.
CoRR
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
2019 J jnl
A Universal Tree Balancing Theorem.
ACM Trans. Comput. Theory
Moses Ganardi, Markus Lohrey
2019 J jnl
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131).
Dagstuhl Reports
Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov
2019 A* conf
Balancing Straight-Line Programs.
FOCS
Moses Ganardi, Artur Jez, Markus Lohrey
2019 J jnl
Balancing Straight-Line Programs.
CoRR
Moses Ganardi, Artur Jez, Markus Lohrey
2019 C conf
Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems.
DSD
Seungbum Jo, Markus Lohrey, Simon Meckel, Roman Obermaisser, Simon Plasger
2019 A conf
Compressed Decision Problems in Hyperbolic Groups.
STACS
Derek F. Holt, Markus Lohrey, Saul Schleimer
2019 Misc conf
Derandomization for Sliding Window Algorithms with Strict Correctness.
CSR
Moses Ganardi, Danny Hucke, Markus Lohrey
2019 B conf
Entropy Bounds for Grammar-Based Tree Compressors.
ISIT
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2019 J jnl
Entropy Bounds for Grammar-Based Tree Compressors.
CoRR
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2019 J jnl
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems.
CoRR
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2019 B conf
Largest Common Prefix of a Regular Tree Language.
FCT
Markus Lohrey, Sebastian Maneth
2019 J jnl
Size-optimal top dag compression.
Inf. Process. Lett.
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
2019 B conf
Sliding Window Property Testing for Regular Languages.
ISAAC
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
2019 J jnl
Sliding window property testing for regular languages.
CoRR
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
2019 B conf
The Power Word Problem.
MFCS
Markus Lohrey, Armin Weiß
2019 J jnl
The power word problem.
CoRR
Markus Lohrey, Armin Weiß
2019 J jnl
The smallest grammar problem revisited.
CoRR
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2019 J jnl
Universal Tree Source Coding Using Grammar-Based Compression.
IEEE Trans. Inf. Theory
Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
2018 J jnl
An architecture for online-diagnosis systems supporting compressed communication.
Microprocess. Microsystems
Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger
2018 A conf
Automata Theory on Sliding Windows.
STACS
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras
2018 B conf
Average Case Analysis of Leaf-Centric Binary Tree Sources.
MFCS
Louisa Seelbach Benkner, Markus Lohrey
2018 J jnl
Average Case Analysis of Leaf-Centric Binary Tree Sources.
CoRR
Louisa Seelbach Benkner, Markus Lohrey
2018 J jnl
Circuits and Expressions over Finite Semirings.
ACM Trans. Comput. Theory
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
2018 J jnl
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees.
Algorithmica
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
2018 J jnl
Evaluation of Circuits Over Nilpotent and Polycyclic Groups.
Algorithmica
Daniel König, Markus Lohrey
2018 Misc conf
Grammar-Based Compression of Unranked Trees.
CSR
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2018 J jnl
Grammar-based Compression of Unranked Trees.
CoRR
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2018 A conf
Knapsack Problems for Wreath Products.
STACS
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
2018 J jnl
Knapsack in Graph Groups.
Theory Comput. Syst.
Markus Lohrey, Georg Zetzsche
2018 — conf
Knapsack in Hyperbolic Groups.
RP
Markus Lohrey
2018 J jnl
Knapsack in hyperbolic groups.
CoRR
Markus Lohrey
2018 J jnl
Parallel identity testing for skew circuits with big powers and applications.
Int. J. Algebra Comput.
Daniel König, Markus Lohrey
2018 A* conf
Randomized Sliding Window Algorithms for Regular Languages.
ICALP
Moses Ganardi, Danny Hucke, Markus Lohrey
2018 J jnl
Randomized sliding window algorithms for regular languages.
CoRR
Moses Ganardi, Danny Hucke, Markus Lohrey
2018 C conf
Sliding Window Algorithms for Regular Languages.
LATA
Moses Ganardi, Danny Hucke, Markus Lohrey
2018 B conf
Sliding Windows over Context-Free Languages.
MFCS
Moses Ganardi, Artur Jez, Markus Lohrey
2018 J jnl
The Complexity of Bisimulation and Simulation on Finite Systems.
CoRR
Moses Ganardi, Stefan Göller, Markus Lohrey
2018 J jnl
The Complexity of Bisimulation and Simulation on Finite Systems.
Log. Methods Comput. Sci.
Moses Ganardi, Stefan Göller, Markus Lohrey
2018 J jnl
Tree Compression Using String Grammars.
Algorithmica
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
2017 J jnl
A universal tree balancing theorem.
CoRR
Moses Ganardi, Markus Lohrey
2017 C conf
An Architecture for Online-Diagnosis Systems Supporting Compressed Communication.
DSD
Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger
2017 J jnl
Approximation ratio of RePair.
CoRR
Danny Hucke, Artur Jez, Markus Lohrey
2017 A conf
Circuit Evaluation for Finite Semirings.
STACS
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
2017 A conf
Compression of Unordered XML Trees.
ICDT
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
2017 A* conf
Computing quantiles in Markov chains with multi-dimensional costs.
LICS
Christoph Haase, Stefan Kiefer, Markus Lohrey
2017 J jnl
Constructing small tree grammars and small circuits for formulas.
J. Comput. Syst. Sci.
Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth
2017 B conf
Counting Problems for Parikh Images.
MFCS
Christoph Haase, Stefan Kiefer, Markus Lohrey
2017 J jnl
Knapsack Problems for Wreath Products.
CoRR
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
2017 J jnl
On Boolean Closed Full Trios and Rational Kripke Frames.
Theory Comput. Syst.
Georg Zetzsche, Dietrich Kuske, Markus Lohrey
2017 J jnl
Optimal top dag compression.
CoRR
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
2017 J jnl
Path Checking for MTL and TPTL over Data Words.
Log. Methods Comput. Sci.
Shiguang Feng, Markus Lohrey, Karin Quaas
2017 J jnl
Processing Succinct Matrices and Vectors.
Theory Comput. Syst.
Markus Lohrey, Manfred Schmidt-Schauß
2017 J jnl
Querying languages over sliding windows.
CoRR
Moses Ganardi, Danny Hucke, Markus Lohrey
2017 J jnl
Satisfiability of ECTL∗ with Local Tree Constraints.
Theory Comput. Syst.
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2017 A conf
The Complexity of Knapsack in Graph Groups.
STACS
Markus Lohrey, Georg Zetzsche
2017 J jnl
Universal Tree Source Coding Using Grammar-Based Compression.
CoRR
Danny Hucke, Markus Lohrey
2017 B conf
Universal tree source coding using grammar-based compression.
ISIT
Danny Hucke, Markus Lohrey
2016 J jnl
Approximation of smallest linear tree grammar.
Inf. Comput.
Artur Jez, Markus Lohrey
2016 J jnl
Circuit Evaluation for Finite Semirings.
CoRR
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
2016 J jnl
Computation over Compressed Structured Data (Dagstuhl Seminar 16431).
Dagstuhl Reports
Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro
2016 J jnl
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images.
CoRR
Christoph Haase, Stefan Kiefer, Markus Lohrey
2016 — conf
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups.
AMS-EMS-SPM Joint Meeting
Daniel König, Markus Lohrey, Georg Zetzsche
2016 A conf
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products.
STACS
Markus Lohrey, Georg Zetzsche
2016 B conf
On the Parallel Complexity of Bisimulation on Finite Systems.
CSL
Moses Ganardi, Stefan Göller, Markus Lohrey
2016 — conf
Querying Regular Languages over Sliding Windows.
FSTTCS
Moses Ganardi, Danny Hucke, Markus Lohrey
2016 J jnl
Satisfiability of ECTL
J. Comput. Syst. Sci.
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
2016 J jnl
The Complexity of Knapsack in Graph Groups.
CoRR
Markus Lohrey, Georg Zetzsche
2016 C conf
The Smallest Grammar Problem Revisited.
SPIRE
Danny Hucke, Markus Lohrey, Carl Philipp Reh
2016 B conf
Traversing Grammar-Compressed Trees with Constant Delay.
DCC
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
2016 B conf
Tree Compression Using String Grammars.
LATIN
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
2015 — conf
Compressed Tree Canonization.
ICALP (2)
Markus Lohrey, Sebastian Maneth, Fabian Peternek
2015 J jnl
Compressed Tree Canonization.
CoRR
Markus Lohrey, Sebastian Maneth, Fabian Peternek
2015 — conf
Equality Testing of Compressed Strings.
WORDS
Markus Lohrey
2015 Misc conf
Evaluating Matrix Circuits.
COCOON
Daniel König, Markus Lohrey
2015 J jnl
Evaluating Matrix Circuits.
CoRR
Daniel König, Markus Lohrey
2015 C conf
Grammar-Based Tree Compression.
DLT
Markus Lohrey
2015 J jnl
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups.
CoRR
Daniel König, Markus Lohrey, Georg Zetzsche
2015 J jnl
Knapsack in graph groups, HNN-extensions and amalgamated products.
CoRR
Markus Lohrey, Georg Zetzsche
2015 — conf
Parallel Identity Testing for Skew Circuits with Big Powers and Applications.
MFCS (2)
Daniel König, Markus Lohrey
2015 J jnl
Parallel Identity Testing for Skew Circuits with Big Powers and Applications.
CoRR
Daniel König, Markus Lohrey
2015 C conf
Path Checking for MTL and TPTL over Data Words.
DLT
Shiguang Feng, Markus Lohrey, Karin Quaas
2015 J jnl
Rational subsets and submonoids of wreath products.
Inf. Comput.
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2015 J jnl
Rational subsets of unitriangular groups.
Int. J. Algebra Comput.
Markus Lohrey
2015 Misc conf
Satisfiability of ECTL* with Tree Constraints.
CSR
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2015 B conf
Temporal Logics with Local Constraints (Invited Talk).
CSL
Claudia Carapelle, Markus Lohrey
2015 J jnl
The Complexity of Decomposing Modal and First-Order Theories.
ACM Trans. Comput. Log.
Stefan Göller, Jean Christoph Jung, Markus Lohrey
2015 J jnl
Traversing Grammar-Compressed Trees with Constant Delay.
CoRR
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
2015 J jnl
Tree compression using string grammars.
CoRR
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
2015 J jnl
XML Compression via Directed Acyclic Graphs.
Theory Comput. Syst.
Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth
2014 A conf
Approximation of smallest linear tree grammar.
STACS
Artur Jez, Markus Lohrey
2014 — conf
Constructing Small Tree Grammars and Small Circuits for Formulas.
FSTTCS
Danny Hucke, Markus Lohrey, Eric Noeth
2014 J jnl
Constructing small tree grammars and small circuits for formulas.
CoRR
Danny Hucke, Markus Lohrey, Eric Noeth
2014 A conf
On Boolean closed full trios and rational Kripke frames.
STACS
Markus Lohrey, Georg Zetzsche
2014 J jnl
Path-Checking for MTL and TPTL over Data Words.
CoRR
Shiguang Feng, Markus Lohrey, Karin Quaas
2014 Misc conf
Processing Succinct Matrices and Vectors.
CSR
Markus Lohrey, Manfred Schmidt-Schauß
2014 J jnl
Processing Succinct Matrices and Vectors.
CoRR
Markus Lohrey, Manfred Schmidt-Schauß
2014 J jnl
Satisfiability of ECTL* with tree constraints.
CoRR
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2014 — book
The Compressed Word Problem for Groups.
Markus Lohrey
2014 J jnl
The First-Order Theory of Ground Tree Rewrite Graphs
Log. Methods Comput. Sci.
Stefan Göller, Markus Lohrey
2013 J jnl
Approximation of smallest linear tree grammar.
CoRR
Artur Jez, Markus Lohrey
2013 J jnl
Branching-Time Model Checking of One-Counter Processes and Timed Automata.
SIAM J. Comput.
Stefan Göller, Markus Lohrey
2013 — conf
Compression of Rewriting Systems for Termination Analysis.
RTA
Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann
2013 J jnl
Isomorphism of regular trees and words.
Inf. Comput.
Markus Lohrey, Christian Mathissen
2013 J jnl
Rational Subsets and Submonoids of Wreath Products
CoRR
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2013 — conf
Rational Subsets and Submonoids of Wreath Products.
ICALP (2)
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2013 B conf
Satisfiability of CTL* with Constraints.
CONCUR
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
2013 J jnl
Satisfiability of CTL* with constraints.
CoRR
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
2013 J jnl
The isomorphism problem for ω-automatic trees.
Ann. Pure Appl. Log.
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2013 J jnl
Tree-Automatic Well-Founded Trees
Log. Methods Comput. Sci.
Martin Huschenbett, Alexander Kartzow, Jiamou Liu, Markus Lohrey
2013 J jnl
XML Compression via DAGs.
CoRR
Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Noeth
2013 A conf
XML compression via DAGs.
ICDT
Markus Lohrey, Sebastian Maneth, Eric Noeth
2013 J jnl
XML tree structure compression using RePair.
Inf. Syst.
Markus Lohrey, Sebastian Maneth, Roy Mennicke
2012 J jnl
Algorithmics on SLP-compressed strings: A survey.
Groups Complex. Cryptol.
Markus Lohrey
2012 J jnl
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups.
Int. J. Algebra Comput.
Niko Haubold, Markus Lohrey, Christian Mathissen
2012 B conf
Logspace Computations in Graph Groups and Coxeter Groups.
LATIN
Volker Diekert, Jonathan Kausch, Markus Lohrey
2012 J jnl
Model-checking hierarchical structures.
J. Comput. Syst. Sci.
Markus Lohrey
2012 J jnl
Parameter reduction and automata evaluation for grammar-compressed trees.
J. Comput. Syst. Sci.
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
2012 A* conf
The Complexity of Decomposing Modal and First-Order Theories.
LICS
Stefan Göller, Jean Christoph Jung, Markus Lohrey
2012 C conf
Tree-Automatic Well-Founded Trees.
CiE
Alexander Kartzow, Jiamou Liu, Markus Lohrey
2011 J jnl
Automatic structures of bounded degree revisited.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2011 Misc conf
Compressed Membership in Automata with Compressed Labels.
CSR
Markus Lohrey, Christian Mathissen
2011 B conf
Compressed Word Problems for Inverse Monoids.
MFCS
Markus Lohrey
2011 J jnl
Compressed Word Problems in HNN-extensions and Amalgamated Products.
Theory Comput. Syst.
Niko Haubold, Markus Lohrey
2011 J jnl
Fixpoint Logics over Hierarchical Structures.
Theory Comput. Syst.
Stefan Göller, Markus Lohrey
2011 — conf
Isomorphism of Regular Trees and Words.
ICALP (2)
Markus Lohrey, Christian Mathissen
2011 J jnl
Isomorphism of regular trees and words
CoRR
Markus Lohrey, Christian Mathissen
2011 J jnl
Leaf languages and string compression.
Inf. Comput.
Markus Lohrey
2011 — conf
The First-Order Theory of Ground Tree Rewrite Graphs.
FSTTCS
Stefan Göller, Markus Lohrey
2011 J jnl
Tilings and Submonoids of Metabelian Groups.
Theory Comput. Syst.
Markus Lohrey, Benjamin Steinberg
2011 B conf
Tree Structure Compression with RePair.
DCC
Markus Lohrey, Sebastian Maneth, Roy Mennicke
2010 A conf
Branching-time Model Checking of One-counter Processes.
STACS
Stefan Göller, Markus Lohrey
2010 C conf
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups.
Developments in Language Theory
Niko Haubold, Markus Lohrey, Christian Mathissen
2010 J jnl
Compressed Membership Problems for Regular Expressions and Hierarchical Automata.
Int. J. Found. Comput. Sci.
Markus Lohrey
2010 J jnl
Some natural decision problems in automatic graphs.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2010 J jnl
The Isomorphism Problem On Classes of Automatic Structures
CoRR
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 B conf
The Isomorphism Problem for
CSL
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 J jnl
The Isomorphism Problem for omega-Automatic Trees
CoRR
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 A* conf
The Isomorphism Problem on Classes of Automatic Structures.
LICS
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 J jnl
Tree structure compression with RePair
CoRR
Markus Lohrey, Sebastian Maneth, Roy Mennicke
2009 B conf
Automatic Structures of Bounded Degree Revisited.
CSL
Dietrich Kuske, Markus Lohrey
2009 J jnl
Branching-time model checking of one-counter processes
CoRR
Stefan Göller, Markus Lohrey
2009 J jnl
Branching-time model checking of one-counter processes
CoRR
Stefan Göller, Markus Lohrey
2009 Misc conf
Compressed Word Problems in HNN-Extensions and Amalgamated Products.
CSR
Niko Haubold, Markus Lohrey
2009 J jnl
PDL with intersection and converse: satisfiability and infinite-state model checking.
J. Symb. Log.
Stefan Göller, Markus Lohrey, Carsten Lutz
2009 B conf
Parameter Reduction in Grammar-Compressed Trees.
FoSSaCS
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
2008 — conf
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data.
Structure-Based Compression of Complex Massive Data
Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008 — conf
08261 Executive Summary - Structure-Based Compression of Complex Massive Data.
Structure-Based Compression of Complex Massive Data
Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008 J jnl
Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
Int. J. Algebra Comput.
Volker Diekert, Nicole Ondrusch, Markus Lohrey
2008 — ed.
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2008 J jnl
Automatic structures of bounded degree revisited
CoRR
Dietrich Kuske, Markus Lohrey
2008 — conf
Compressed membership problems revisited.
AFL
Markus Lohrey
2008 J jnl
Efficient memory representation of XML document trees.
Inf. Syst.
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
2008 — conf
Euler paths and ends in automatic and recursive graphs.
AFL
Dietrich Kuske, Markus Lohrey
2008 J jnl
First-order and counting theories of omega-automatic structures.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2008 — conf
Hamiltonicity of automatic graphs.
IFIP TCS
Dietrich Kuske, Markus Lohrey
2008 — conf
Leaf languages and string compression.
FSTTCS
Markus Lohrey
2008 J jnl
Rational Subsets in HNN-Extensions and Amalgamated Products.
Int. J. Algebra Comput.
Markus Lohrey, Géraud Sénizergues
2008 — ed.
Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008
Structure-Based Compression of Complex Massive Data
Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008 J jnl
Word Equations over Graph Products.
Int. J. Algebra Comput.
Volker Diekert, Markus Lohrey
2007 — conf
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2007 — conf
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2007 — conf
Application of verification techniques to inverse monoids.
Algorithmic-Logical Theory of Infinite Structures
Markus Lohrey
2007 Misc conf
Efficient Computation in Groups Via Compression.
CSR
Markus Lohrey, Saul Schleimer
2007 J jnl
Inverse monoids: Decidability and complexity of algebraic questions.
Inf. Comput.
Markus Lohrey, Nicole Ondrusch
2007 B conf
PDL with Intersection and Converse Is 2 EXP-Complete.
FoSSaCS
Stefan Göller, Markus Lohrey, Carsten Lutz
2007 — conf
PDL with Intersection and Converse is 2EXP-complete.
Algorithmic-Logical Theory of Infinite Structures
Stefan Göller, Markus Lohrey, Carsten Lutz
2007 C conf
The submonoid and rational subset membership problems for graph groups.
LATA
Markus Lohrey, Benjamin Steinberg
2006 B conf
First-Order and Counting Theories of
FoSSaCS
Dietrich Kuske, Markus Lohrey
2006 B conf
Infinite State Model-Checking of Propositional Dynamic Logics.
CSL
Stefan Göller, Markus Lohrey
2006 J jnl
Logical Aspects of Cayley-graphs: the Monoid Case.
Int. J. Algebra Comput.
Dietrich Kuske, Markus Lohrey
2006 A* conf
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.
LICS
Dietrich Kuske, Markus Lohrey
2006 B conf
Partially Commutative Inverse Monoids.
MFCS
Volker Diekert, Markus Lohrey, Alexander Miller
2006 B conf
Querying and Embedding Compressed Texts.
MFCS
Yury Lifshits, Markus Lohrey
2006 J jnl
The complexity of tree automata and XPath on grammar-compressed trees.
Theor. Comput. Sci.
Markus Lohrey, Sebastian Maneth
2006 — conf
Theories of HNN-Extensions and Amalgamated Products.
ICALP (2)
Markus Lohrey, Géraud Sénizergues
2006 J jnl
Word Problems and Membership Problems on Compressed Words.
SIAM J. Comput.
Markus Lohrey
2005 J jnl
Axiomatising divergence.
Inf. Comput.
Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns
2005 J jnl
Complexity results for prefix grammars.
RAIRO Theor. Informatics Appl.
Markus Lohrey, Holger Petersen
2005 J jnl
Decidability and complexity in automatic monoids.
Int. J. Found. Comput. Sci.
Markus Lohrey
2005 J jnl
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.
Theory Comput. Syst.
Dietrich Kuske, Markus Lohrey
2005 — conf
Efficient Memory Representation of XML Documents.
DBPL
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
2005 — conf
Fixpoint Logics on Hierarchical Structures.
FSTTCS
Stefan Göller, Markus Lohrey
2005 B conf
Inverse Monoids: Decidability and Complexity of Algebraic Questions.
MFCS
Markus Lohrey, Nicole Ondrusch
2005 J jnl
Logical aspects of Cayley-graphs: the group case.
Ann. Pure Appl. Log.
Dietrich Kuske, Markus Lohrey
2005 A* conf
Model-Checking Hierarchical Structures.
LICS
Markus Lohrey
2005 C conf
Tree Automata and XPath on Compressed Trees.
CIAA
Markus Lohrey, Sebastian Maneth
2004 J jnl
Bounded MSC communication.
Inf. Comput.
Markus Lohrey, Anca Muscholl
2004 C conf
Decidability and Complexity in Automatic Monoids.
Developments in Language Theory
Markus Lohrey
2004 J jnl
Existential and Positive Theories of Equations in Graph Products.
Theory Comput. Syst.
Volker Diekert, Markus Lohrey
2004 A* conf
Word Problems on Compressed Words.
ICALP
Markus Lohrey
2003 B conf
Automatic Structures of Bounded Degree.
LPAR
Markus Lohrey
2003 — book
Computational and logical aspects of infinite monoids.
Markus Lohrey
2003 A conf
Decidable Theories of Cayley-Graphs.
STACS
Dietrich Kuske, Markus Lohrey
2003 J jnl
Realizability of high-level message sequence charts: closing the gaps.
Theor. Comput. Sci.
Markus Lohrey
2003 — conf
Word Equations over Graph Products.
FSTTCS
Volker Diekert, Markus Lohrey
2002 J jnl
A Note on The Existential Theory of Equations in Plain Groups.
Int. J. Algebra Comput.
Volker Diekert, Markus Lohrey
2002 A* conf
Axiomatising Divergence.
ICALP
Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns
2002 B conf
Bounded MSC Communication.
FoSSaCS
Markus Lohrey, Anca Muscholl
2002 A conf
Existential and Positive Theories of Equations in Graph Products.
STACS
Volker Diekert, Markus Lohrey
2002 A* conf
On the Theory of One-Step Rewriting in Trace Monoids.
ICALP
Dietrich Kuske, Markus Lohrey
2002 B conf
Safe Realizability of High-Level Message Sequence Charts.
CONCUR
Markus Lohrey
2001 J jnl
Confluence Problems for Trace Rewriting Systems.
Inf. Comput.
Markus Lohrey
2001 — conf
On the Parallel Complexity of Tree Automata.
RTA
Markus Lohrey
2001 B conf
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.
MFCS
Markus Lohrey
2000 — conf
Word Problems and Confluence Problems for Restricted Semi-Thue Systems.
RTA
Markus Lohrey
1999 B conf
Complexity Results for Confluence Problems.
MFCS
Markus Lohrey
1999 — —
Das Konfluenzproblem für Spurersetzungssysteme.
Markus Lohrey
1998 J jnl
NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars.
Acta Cybern.
Markus Lohrey
1998 — conf
On the Confluence of Trace Rewriting Systems.
FSTTCS
Markus Lohrey
1998 B conf
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract).
CONCUR
Holger Hermanns, Markus Lohrey