Markus Lohrey

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 104

Top Venues

Universität Stuttgart (PHD)

Education History

Universität Stuttgart

PHD

Publications

Markus Lohrey, Florian Stober, Armin Weiß
The Power Word Problem in Graph Products. Theory Comput. Syst. 68 (3) (2024)
Markus Lohrey, Julio Xochitemol
Streaming in Graph Products. MFCS (2024)
Markus Lohrey, Markus L. Schmid
Enumeration for MSO-Queries on Compressed Trees. CoRR (2024)
Markus Lohrey
Membership Problems in Infinite Groups. CiE (2024)
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya
Regular Languages in the Sliding Window Model. CoRR (2024)
Markus Lohrey, Markus L. Schmid
Enumeration for MSO-Queries on Compressed Trees. Proc. ACM Manag. Data 2 (2) (2024)
Moses Ganardi, Markus Lohrey, Georg Zetzsche
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33 (3) (2023)
Markus Lohrey, Andreas Rosowski
On the Complexity of Diameter and Related Problems in Permutation Groups. ICALP (2023)
Markus Lohrey
Complexity of word problems for HNN-extensions. J. Comput. Syst. Sci. 135 (2023)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM Trans. Comput. Theory 14 (3-4) (2022)
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS (2022)
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
Low-Latency Sliding Window Algorithms for Formal Languages. CoRR (2022)
Michael Figelius, Markus Lohrey
Exponent Equations in HNN-extensions. ISSAC (2022)
Markus Lohrey, Lukas Lück
Streaming word problems. CoRR (2022)
Markus Lohrey, Lukas Lück
Streaming Word Problems. MFCS (2022)
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
Membership Problems in Finite Groups. MFCS (2022)
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
Membership Problems in Finite Groups. CoRR (2022)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-line Programs. J. ACM 68 (4) (2021)
Moses Ganardi, Danny Hucke, Markus Lohrey
. Theory Comput. Syst. 65 (3) (2021)
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
Entropy Bounds for Grammar-Based Tree Compressors. IEEE Trans. Inf. Theory 67 (11) (2021)
Markus Lohrey
Compression Techniques in Group Theory. CiE (2021)
Markus Lohrey
Subgroup Membership in GL(2, Z). STACS (2021)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67 (1) (2021)
Markus Lohrey, Sebastian Maneth
Largest common prefix of a regular tree language. J. Comput. Syst. Sci. 115 (2021)
Markus Lohrey
Complexity of Word Problems for HNN-Extensions. FCT (2021)
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
A Comparison of Empirical Tree Entropies. CoRR (2020)
Markus Lohrey, Georg Zetzsche
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. MFCS (2020)
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
A Comparison of Empirical Tree Entropies. SPIRE (2020)
Markus Lohrey
Balancing Straight-Line Programs for Strings and Trees. CiE (2020)
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
Grammar-Based Compression of Unranked Trees. Theory Comput. Syst. 64 (1) (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The complexity of knapsack problems in wreath products. CoRR (2020)
Simon Meckel, Markus Lohrey, Seungbum Jo, Roman Obermaisser, Simon Plasger
Combined compression of multiple correlated data streams for online-diagnosis systems. Microprocess. Microsystems 77 (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack Problems in Wreath Products. ICALP (2020)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. Computational Complexity Conference (2020)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The smallest grammar problem revisited. CoRR (2019)
Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). Dagstuhl Reports 9 (3) (2019)
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
Entropy Bounds for Grammar-Based Tree Compressors. CoRR (2019)
Markus Lohrey, Armin Weiß
The power word problem. CoRR (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding Window Property Testing for Regular Languages. ISAAC (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey
Derandomization for Sliding Window Algorithms with Strict Correctness. CSR (2019)
Markus Lohrey, Armin Weiß
The Power Word Problem. MFCS (2019)
Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
Entropy Bounds for Grammar-Based Tree Compressors. ISIT (2019)
Markus Lohrey, Sebastian Maneth
Largest Common Prefix of a Regular Tree Language. FCT (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. FOCS (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding window property testing for regular languages. CoRR (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65 (10) (2019)
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
Size-optimal top dag compression. Inf. Process. Lett. 147 (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. CoRR (2019)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR (2019)
Derek F. Holt, Markus Lohrey, Saul Schleimer
Compressed Decision Problems in Hyperbolic Groups. STACS (2019)
Seungbum Jo, Markus Lohrey, Simon Meckel, Roman Obermaisser, Simon Plasger
Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems. DSD (2019)
Moses Ganardi, Markus Lohrey
A Universal Tree Balancing Theorem. ACM Trans. Comput. Theory 11 (1) (2019)
Markus Lohrey
Knapsack in hyperbolic groups. CoRR (2018)
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
Grammar-Based Compression of Unranked Trees. CSR (2018)
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. Algorithmica 80 (7) (2018)
Markus Lohrey
Knapsack in Hyperbolic Groups. RP (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Randomized sliding window algorithms for regular languages. CoRR (2018)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras
Automata Theory on Sliding Windows. STACS (2018)
Daniel König, Markus Lohrey
Parallel identity testing for skew circuits with big powers and applications. Int. J. Algebra Comput. 28 (6) (2018)
Louisa Seelbach Benkner, Markus Lohrey
Average Case Analysis of Leaf-Centric Binary Tree Sources. CoRR (2018)
Louisa Seelbach Benkner, Markus Lohrey
Average Case Analysis of Leaf-Centric Binary Tree Sources. MFCS (2018)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14 (4) (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Randomized Sliding Window Algorithms for Regular Languages. ICALP (2018)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuits and Expressions over Finite Semirings. ACM Trans. Comput. Theory 10 (4) (2018)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. STACS (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
Tree Compression Using String Grammars. Algorithmica 80 (3) (2018)
Daniel König, Markus Lohrey
Evaluation of Circuits Over Nilpotent and Polycyclic Groups. Algorithmica 80 (5) (2018)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR (2018)
Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger
An architecture for online-diagnosis systems supporting compressed communication. Microprocess. Microsystems 61 (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Sliding Window Algorithms for Regular Languages. LATA (2018)
Markus Lohrey, Georg Zetzsche
Knapsack in Graph Groups. Theory Comput. Syst. 62 (1) (2018)
Moses Ganardi, Artur Jez, Markus Lohrey
Sliding Windows over Context-Free Languages. MFCS (2018)
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
Grammar-based Compression of Unranked Trees. CoRR (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Querying languages over sliding windows. CoRR (2017)
Shiguang Feng, Markus Lohrey, Karin Quaas
Path Checking for MTL and TPTL over Data Words. Log. Methods Comput. Sci. 13 (3) (2017)
Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack in Graph Groups. STACS (2017)
Moses Ganardi, Markus Lohrey
A universal tree balancing theorem. CoRR (2017)
Danny Hucke, Artur Jez, Markus Lohrey
Approximation ratio of RePair. CoRR (2017)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. CoRR (2017)
Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger
An Architecture for Online-Diagnosis Systems Supporting Compressed Communication. DSD (2017)
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
Compression of Unordered XML Trees. ICDT (2017)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Computing quantiles in Markov chains with multi-dimensional costs. LICS (2017)
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
Optimal top dag compression. CoRR (2017)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Counting Problems for Parikh Images. MFCS (2017)
Markus Lohrey, Manfred Schmidt-Schauß
Processing Succinct Matrices and Vectors. Theory Comput. Syst. 61 (2) (2017)
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
Satisfiability of ECTL∗ with Local Tree Constraints. Theory Comput. Syst. 61 (2) (2017)
Georg Zetzsche, Dietrich Kuske, Markus Lohrey
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60 (3) (2017)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuit Evaluation for Finite Semirings. STACS (2017)
Danny Hucke, Markus Lohrey
Universal tree source coding using grammar-based compression. ISIT (2017)
Danny Hucke, Markus Lohrey
Universal Tree Source Coding Using Grammar-Based Compression. CoRR (2017)
Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86 (2017)
Danny Hucke, Markus Lohrey, Carl Philipp Reh
The Smallest Grammar Problem Revisited. SPIRE (2016)
Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro
Computation over Compressed Structured Data (Dagstuhl Seminar 16431). Dagstuhl Reports 6 (10) (2016)
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
Tree Compression Using String Grammars. LATIN (2016)
Artur Jez, Markus Lohrey
Approximation of smallest linear tree grammar. Inf. Comput. 251 (2016)
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
with constraints. J. Comput. Syst. Sci. 82 (5) (2016)
Moses Ganardi, Danny Hucke, Markus Lohrey
Querying Regular Languages over Sliding Windows. FSTTCS (2016)
Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. AMS-EMS-SPM Joint Meeting (2016)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR (2016)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuit Evaluation for Finite Semirings. CoRR (2016)

Markus Lohrey.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Markus Lohrey