default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Lohrey
Person information
- affiliation: Universität Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j74]Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya:
Regular Languages in the Sliding Window Model. TheoretiCS 4 (2025)- 2024
- [j73]Markus Lohrey, Florian Stober
, Armin Weiß:
The Power Word Problem in Graph Products. Theory Comput. Syst. 68(3): 403-464 (2024) - [j72]Markus Lohrey:
Subgroup Membership in GL(2,Z). Theory Comput. Syst. 68(4): 1082-1107 (2024) - [j71]Markus Lohrey, Markus L. Schmid:
Enumeration for MSO-Queries on Compressed Trees. Proc. ACM Manag. Data 2(2): 78 (2024) - [c110]Markus Lohrey:
Membership Problems in Infinite Groups. CiE 2024: 44-59 - [c109]Markus Lohrey, Julio Xochitemol:
Streaming in Graph Products. MFCS 2024: 71:1-71:17 - [i57]Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya:
Regular Languages in the Sliding Window Model. CoRR abs/2402.13385 (2024) - [i56]Markus Lohrey, Markus L. Schmid:
Enumeration for MSO-Queries on Compressed Trees. CoRR abs/2403.03067 (2024) - 2023
- [j70]Moses Ganardi, Markus Lohrey, Georg Zetzsche:
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33(3): 617-639 (2023) - [j69]Markus Lohrey:
Complexity of word problems for HNN-extensions. J. Comput. Syst. Sci. 135: 145-157 (2023) - [c108]Markus Lohrey, Andreas Rosowski:
On the Complexity of Diameter and Related Problems in Permutation Groups. ICALP 2023: 134:1-134:18 - 2022
- [j68]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): 1-41 (2022) - [c107]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS 2022: 38:1-38:23 - [c106]Michael Figelius, Markus Lohrey:
Exponent Equations in HNN-extensions. ISSAC 2022: 293-301 - [c105]Markus Lohrey, Andreas Rosowski, Georg Zetzsche:
Membership Problems in Finite Groups. MFCS 2022: 71:1-71:16 - [c104]Markus Lohrey, Lukas Lück:
Streaming Word Problems. MFCS 2022: 72:1-72:15 - [i55]Markus Lohrey, Lukas Lück:
Streaming word problems. CoRR abs/2202.04060 (2022) - [i54]Markus Lohrey, Andreas Rosowski, Georg Zetzsche:
Membership Problems in Finite Groups. CoRR abs/2206.11756 (2022) - [i53]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. CoRR abs/2209.14835 (2022) - 2021
- [j67]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-line Programs. J. ACM 68(4): 27:1-27:40 (2021) - [j66]Markus Lohrey, Sebastian Maneth:
Largest common prefix of a regular tree language. J. Comput. Syst. Sci. 115: 235-245 (2021) - [j65]Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness∗. Theory Comput. Syst. 65(3): 1-18 (2021) - [j64]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): 317-328 (2021) - [j63]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. IEEE Trans. Inf. Theory 67(11): 7596-7615 (2021) - [c103]Markus Lohrey:
Compression Techniques in Group Theory. CiE 2021: 330-341 - [c102]Markus Lohrey:
Complexity of Word Problems for HNN-Extensions. FCT 2021: 371-384 - [c101]Markus Lohrey:
Subgroup Membership in GL(2, Z). STACS 2021: 51:1-51:17 - 2020
- [j62]Simon Meckel, Markus Lohrey, Seungbum Jo, Roman Obermaisser, Simon Plasger:
Combined compression of multiple correlated data streams for online-diagnosis systems. Microprocess. Microsystems 77: 103184 (2020) - [j61]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. Theory Comput. Syst. 64(1): 141-176 (2020) - [c100]Markus Lohrey:
Balancing Straight-Line Programs for Strings and Trees. CiE 2020: 296-300 - [c99]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. CCC 2020: 29:1-29:29 - [c98]Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack Problems in Wreath Products. ICALP 2020: 126:1-126:18 - [c97]Markus Lohrey, Georg Zetzsche:
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. MFCS 2020: 67:1-67:15 - [c96]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. SPIRE 2020: 232-246 - [i52]Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche:
The complexity of knapsack problems in wreath products. CoRR abs/2002.08086 (2020) - [i51]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
A Comparison of Empirical Tree Entropies. CoRR abs/2006.01695 (2020)
2010 – 2019
- 2019
- [j60]Markus Lohrey, Carl Philipp Reh, Kurt Sieber:
Size-optimal top dag compression. Inf. Process. Lett. 147: 27-31 (2019) - [j59]Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65(10): 6399-6413 (2019) - [j58]Moses Ganardi, Markus Lohrey:
A Universal Tree Balancing Theorem. ACM Trans. Comput. Theory 11(1): 1:1-1:25 (2019) - [c95]Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness. CSR 2019: 237-249 - [c94]Seungbum Jo, Markus Lohrey, Simon Meckel, Roman Obermaisser, Simon Plasger:
Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems. DSD 2019: 166-173 - [c93]Markus Lohrey, Sebastian Maneth:
Largest Common Prefix of a Regular Tree Language. FCT 2019: 95-108 - [c92]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. FOCS 2019: 1169-1183 - [c91]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding Window Property Testing for Regular Languages. ISAAC 2019: 6:1-6:13 - [c90]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. ISIT 2019: 1687-1691 - [c89]Markus Lohrey, Armin Weiß:
The Power Word Problem. MFCS 2019: 43:1-43:15 - [c88]Derek F. Holt, Markus Lohrey, Saul Schleimer:
Compressed Decision Problems in Hyperbolic Groups. STACS 2019: 37:1-37:16 - [i50]Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. CoRR abs/1901.03155 (2019) - [i49]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. CoRR abs/1902.03568 (2019) - [i48]Markus Lohrey, Armin Weiß:
The power word problem. CoRR abs/1904.08343 (2019) - [i47]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The smallest grammar problem revisited. CoRR abs/1908.06428 (2019) - [i46]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding window property testing for regular languages. CoRR abs/1909.10261 (2019) - [i45]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR abs/1909.13781 (2019) - [i44]Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov:
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). Dagstuhl Reports 9(3): 83-110 (2019) - 2018
- [j57]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. Algorithmica 80(3): 885-917 (2018) - [j56]Daniel König, Markus Lohrey:
Evaluation of Circuits Over Nilpotent and Polycyclic Groups. Algorithmica 80(5): 1459-1492 (2018) - [j55]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. Algorithmica 80(7): 2082-2105 (2018) - [j54]Daniel König, Markus Lohrey:
Parallel identity testing for skew circuits with big powers and applications. Int. J. Algebra Comput. 28(6): 979-1004 (2018) - [j53]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14(4) (2018) - [j52]Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger:
An architecture for online-diagnosis systems supporting compressed communication. Microprocess. Microsystems 61: 242-256 (2018) - [j51]Markus Lohrey, Georg Zetzsche:
Knapsack in Graph Groups. Theory Comput. Syst. 62(1): 192-246 (2018) - [j50]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuits and Expressions over Finite Semirings. ACM Trans. Comput. Theory 10(4): 15:1-15:30 (2018) - [c87]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. CSR 2018: 118-131 - [c86]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized Sliding Window Algorithms for Regular Languages. ICALP 2018: 127:1-127:13 - [c85]Moses Ganardi, Danny Hucke, Markus Lohrey:
Sliding Window Algorithms for Regular Languages. LATA 2018: 26-35 - [c84]Moses Ganardi, Artur Jez, Markus Lohrey:
Sliding Windows over Context-Free Languages. MFCS 2018: 15:1-15:15 - [c83]Louisa Seelbach Benkner, Markus Lohrey:
Average Case Analysis of Leaf-Centric Binary Tree Sources. MFCS 2018: 16:1-16:15 - [c82]Markus Lohrey:
Knapsack in Hyperbolic Groups. RP 2018: 87-102 - [c81]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras:
Automata Theory on Sliding Windows. STACS 2018: 31:1-31:14 - [c80]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. STACS 2018: 32:1-32:13 - [i43]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-based Compression of Unranked Trees. CoRR abs/1802.05490 (2018) - [i42]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized sliding window algorithms for regular languages. CoRR abs/1802.07600 (2018) - [i41]Louisa Seelbach Benkner, Markus Lohrey:
Average Case Analysis of Leaf-Centric Binary Tree Sources. CoRR abs/1804.10396 (2018) - [i40]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR abs/1806.00256 (2018) - [i39]Markus Lohrey:
Knapsack in hyperbolic groups. CoRR abs/1807.06774 (2018) - 2017
- [j49]Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth:
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86: 136-158 (2017) - [j48]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. Log. Methods Comput. Sci. 13(3) (2017) - [j47]Georg Zetzsche, Dietrich Kuske, Markus Lohrey:
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60(3): 438-472 (2017) - [j46]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. Theory Comput. Syst. 61(2): 322-351 (2017) - [j45]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL∗ with Local Tree Constraints. Theory Comput. Syst. 61(2): 689-720 (2017) - [c79]Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger:
An Architecture for Online-Diagnosis Systems Supporting Compressed Communication. DSD 2017: 62-69 - [c78]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Compression of Unordered XML Trees. ICDT 2017: 18:1-18:17 - [c77]Danny Hucke, Markus Lohrey:
Universal tree source coding using grammar-based compression. ISIT 2017: 1753-1757 - [c76]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Computing quantiles in Markov chains with multi-dimensional costs. LICS 2017: 1-12 - [c75]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Counting Problems for Parikh Images. MFCS 2017: 12:1-12:13 - [c74]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. STACS 2017: 35:1-35:14 - [c73]Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack in Graph Groups. STACS 2017: 52:1-52:14 - [i38]Danny Hucke, Markus Lohrey:
Universal Tree Source Coding Using Grammar-Based Compression. CoRR abs/1701.08785 (2017) - [i37]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying languages over sliding windows. CoRR abs/1702.04376 (2017) - [i36]Danny Hucke, Artur Jez, Markus Lohrey:
Approximation ratio of RePair. CoRR abs/1703.06061 (2017) - [i35]Moses Ganardi, Markus Lohrey:
A universal tree balancing theorem. CoRR abs/1704.08705 (2017) - [i34]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. CoRR abs/1709.09598 (2017) - [i33]Markus Lohrey, Carl Philipp Reh, Kurt Sieber:
Optimal top dag compression. CoRR abs/1712.05822 (2017) - 2016
- [j44]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. Inf. Comput. 251: 215-251 (2016) - [j43]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL⁎ with constraints. J. Comput. Syst. Sci. 82(5): 826-855 (2016) - [c72]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 - [c71]Moses Ganardi, Stefan Göller, Markus Lohrey:
On the Parallel Complexity of Bisimulation on Finite Systems. CSL 2016: 12:1-12:17 - [c70]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Traversing Grammar-Compressed Trees with Constant Delay. DCC 2016: 546-555 - [c69]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying Regular Languages over Sliding Windows. FSTTCS 2016: 18:1-18:14 - [c68]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. LATIN 2016: 590-604 - [c67]Danny Hucke, Markus Lohrey, Carl Philipp Reh:
The Smallest Grammar Problem Revisited. SPIRE 2016: 35-49 - [c66]Markus Lohrey, Georg Zetzsche:
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. STACS 2016: 50:1-50:14 - [i32]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR abs/1601.04661 (2016) - [i31]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. CoRR abs/1602.04560 (2016) - [i30]Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack in Graph Groups. CoRR abs/1610.00373 (2016) - [i29]Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro:
Computation over Compressed Structured Data (Dagstuhl Seminar 16431). Dagstuhl Reports 6(10): 99-119 (2016) - 2015
- [j42]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche:
Rational subsets and submonoids of wreath products. Inf. Comput. 243: 191-204 (2015) - [j41]Markus Lohrey:
Rational subsets of unitriangular groups. Int. J. Algebra Comput. 25(1-2): 113-121 (2015) - [j40]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth:
XML Compression via Directed Acyclic Graphs. Theory Comput. Syst. 57(4): 1322-1371 (2015) - [j39]Stefan Göller, Jean Christoph Jung, Markus Lohrey:
The Complexity of Decomposing Modal and First-Order Theories. ACM Trans. Comput. Log. 16(1): 9:1-9:43 (2015) - [c65]Daniel König, Markus Lohrey:
Evaluating Matrix Circuits. COCOON 2015: 235-248 - [c64]Claudia Carapelle, Markus Lohrey:
Temporal Logics with Local Constraints (Invited Talk). CSL 2015: 2-13 - [c63]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with Tree Constraints. CSR 2015: 94-108 - [c62]Markus Lohrey:
Equality Testing of Compressed Strings. WORDS 2015: 14-26 - [c61]Markus Lohrey:
Grammar-Based Tree Compression. DLT 2015: 46-57 - [c60]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. DLT 2015: 326-339 - [c59]Markus Lohrey, Sebastian Maneth, Fabian Peternek:
Compressed Tree Canonization. ICALP (2) 2015: 337-349 - [c58]Daniel König, Markus Lohrey:
Parallel Identity Testing for Skew Circuits with Big Powers and Applications. MFCS (2) 2015: 445-458 - [i28]Daniel König, Markus Lohrey:
Evaluating Matrix Circuits. CoRR abs/1502.03540 (2015) - [i27]Daniel König, Markus Lohrey:
Parallel Identity Testing for Skew Circuits with Big Powers and Applications. CoRR abs/1502.04545 (2015) - [i26]Markus Lohrey, Sebastian Maneth, Fabian Peternek:
Compressed Tree Canonization. CoRR abs/1502.04625 (2015) - [i25]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree compression using string grammars. CoRR abs/1504.05535 (2015) - [i24]Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. CoRR abs/1507.05145 (2015) - [i23]Markus Lohrey, Georg Zetzsche:
Knapsack in graph groups, HNN-extensions and amalgamated products. CoRR abs/1509.05957 (2015) - [i22]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Traversing Grammar-Compressed Trees with Constant Delay. CoRR abs/1511.02141 (2015) - 2014
- [b3]Markus Lohrey:
The Compressed Word Problem for Groups. Springer Briefs in Mathematics, Springer 2014, ISBN 978-1-4939-0747-2, pp. I-XII, 1-153 - [j38]Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. Log. Methods Comput. Sci. 10(1) (2014) - [c57]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. CSR 2014: 245-258 - [c56]Danny Hucke, Markus Lohrey, Eric Noeth:
Constructing Small Tree Grammars and Small Circuits for Formulas. FSTTCS 2014: 457-468 - [c55]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. STACS 2014: 445-457 - [c54]Markus Lohrey, Georg Zetzsche:
On Boolean closed full trios and rational Kripke frames. STACS 2014: 530-541 - [i21]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. CoRR abs/1402.3452 (2014) - [i20]Danny Hucke, Markus Lohrey, Eric Noeth:
Constructing small tree grammars and small circuits for formulas. CoRR abs/1407.4286 (2014) - [i19]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with tree constraints. CoRR abs/1412.2905 (2014) - [i18]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path-Checking for MTL and TPTL over Data Words. CoRR abs/1412.3644 (2014) - 2013
- [j37]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The isomorphism problem for ω-automatic trees. Ann. Pure Appl. Log. 164(1): 30-48 (2013) - [j36]Martin Huschenbett, Alexander Kartzow, Jiamou Liu, Markus Lohrey:
Tree-Automatic Well-Founded Trees. Log. Methods Comput. Sci. 9(2) (2013) - [j35]Markus Lohrey, Christian Mathissen:
Isomorphism of regular trees and words. Inf. Comput. 224: 71-105 (2013) - [j34]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
XML tree structure compression using RePair. Inf. Syst. 38(8): 1150-1167 (2013) - [j33]Stefan Göller, Markus Lohrey:
Branching-Time Model Checking of One-Counter Processes and Timed Automata. SIAM J. Comput. 42(3): 884-923 (2013) - [c53]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of CTL* with Constraints. CONCUR 2013: 455-469 - [c52]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche:
Rational Subsets and Submonoids of Wreath Products. ICALP (2) 2013: 361-372 - [c51]Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML compression via DAGs. ICDT 2013: 69-80 - [c50]Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann:
Compression of Rewriting Systems for Termination Analysis. RTA 2013: 97-112 - [i17]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche:
Rational Subsets and Submonoids of Wreath Products. CoRR abs/1302.2455 (2013) - [i16]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of CTL* with constraints. CoRR abs/1306.0814 (2013) - [i15]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. CoRR abs/1309.4958 (2013) - [i14]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML Compression via DAGs. CoRR abs/1309.5927 (2013) - 2012
- [j32]Markus Lohrey:
Algorithmics on SLP-compressed strings: A survey. Groups Complex. Cryptol. 4(2): 241-299 (2012) - [j31]Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups. Int. J. Algebra Comput. 22(8) (2012) - [j30]Markus Lohrey:
Model-checking hierarchical structures. J. Comput. Syst. Sci. 78(2): 461-490 (2012) - [j29]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5): 1651-1669 (2012) - [c49]Alexander Kartzow, Jiamou Liu, Markus Lohrey:
Tree-Automatic Well-Founded Trees. CiE 2012: 363-373 - [c48]Volker Diekert, Jonathan Kausch, Markus Lohrey:
Logspace Computations in Graph Groups and Coxeter Groups. LATIN 2012: 243-254 - [c47]Stefan Göller, Jean Christoph Jung, Markus Lohrey:
The Complexity of Decomposing Modal and First-Order Theories. LICS 2012: 325-334 - 2011
- [j28]Markus Lohrey:
Leaf languages and string compression. Inf. Comput. 209(6): 951-965 (2011) - [j27]Dietrich Kuske, Markus Lohrey:
Automatic structures of bounded degree revisited. J. Symb. Log. 76(4): 1352-1380 (2011) - [j26]Stefan Göller, Markus Lohrey:
Fixpoint Logics over Hierarchical Structures. Theory Comput. Syst. 48(1): 93-131 (2011) - [j25]Markus Lohrey, Benjamin Steinberg:
Tilings and Submonoids of Metabelian Groups. Theory Comput. Syst. 48(2): 411-427 (2011) - [j24]Niko Haubold, Markus Lohrey:
Compressed Word Problems in HNN-extensions and Amalgamated Products. Theory Comput. Syst. 49(2): 283-305 (2011) - [c46]Markus Lohrey, Christian Mathissen:
Compressed Membership in Automata with Compressed Labels. CSR 2011: 275-288 - [c45]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
Tree Structure Compression with RePair. DCC 2011: 353-362 - [c44]Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. FSTTCS 2011: 276-287 - [c43]Markus Lohrey, Christian Mathissen:
Isomorphism of Regular Trees and Words. ICALP (2) 2011: 210-221 - [c42]Markus Lohrey:
Compressed Word Problems for Inverse Monoids. MFCS 2011: 448-459 - [i13]Markus Lohrey, Christian Mathissen:
Isomorphism of regular trees and words. CoRR abs/1102.2782 (2011) - 2010
- [j23]Markus Lohrey:
Compressed Membership Problems for Regular Expressions and Hierarchical Automata. Int. J. Found. Comput. Sci. 21(5): 817-841 (2010) - [j22]Dietrich Kuske, Markus Lohrey:
Some natural decision problems in automatic graphs. J. Symb. Log. 75(2): 678-710 (2010) - [c41]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem for omega-Automatic Trees. CSL 2010: 396-410 - [c40]Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. Developments in Language Theory 2010: 218-230 - [c39]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem on Classes of Automatic Structures. LICS 2010: 160-169 - [c38]Stefan Göller, Markus Lohrey:
Branching-time Model Checking of One-counter Processes. STACS 2010: 405-416 - [i12]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem On Classes of Automatic Structures. CoRR abs/1001.2086 (2010) - [i11]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem for omega-Automatic Trees. CoRR abs/1004.0610 (2010) - [i10]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
Tree structure compression with RePair. CoRR abs/1007.5406 (2010)
2000 – 2009
- 2009
- [j21]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Log. 74(1): 279-314 (2009) - [c37]Dietrich Kuske, Markus Lohrey:
Automatic Structures of Bounded Degree Revisited. CSL 2009: 364-378 - [c36]Niko Haubold, Markus Lohrey:
Compressed Word Problems in HNN-Extensions and Amalgamated Products. CSR 2009: 237-249 - [c35]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees. FoSSaCS 2009: 212-226 - [i9]Stefan Göller, Markus Lohrey:
Branching-time model checking of one-counter processes. CoRR abs/0909.1102 (2009) - [i8]Stefan Göller, Markus Lohrey:
Branching-time model checking of one-counter processes. CoRR abs/0912.4117 (2009) - 2008
- [j20]Markus Lohrey, Géraud Sénizergues:
Rational Subsets in HNN-Extensions and Amalgamated Products. Int. J. Algebra Comput. 18(1): 111-163 (2008) - [j19]Volker Diekert, Nicole Ondrusch, Markus Lohrey:
Algorithmic Problems on Inverse Monoids over Virtually Free Groups. Int. J. Algebra Comput. 18(1): 181-208 (2008) - [j18]Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. Int. J. Algebra Comput. 18(3): 493-533 (2008) - [j17]Giorgio Busatto, Markus Lohrey, Sebastian Maneth:
Efficient memory representation of XML document trees. Inf. Syst. 33(4-5): 456-474 (2008) - [j16]Dietrich Kuske, Markus Lohrey:
First-order and counting theories of omega-automatic structures. J. Symb. Log. 73(1): 129-150 (2008) - [c34]Markus Lohrey:
Compressed membership problems revisited. AFL 2008: 31-53 - [c33]Dietrich Kuske, Markus Lohrey:
Euler paths and ends in automatic and recursive graphs. AFL 2008: 245-256 - [c32]Markus Lohrey:
Leaf languages and string compression. FSTTCS 2008: 292-303 - [c31]Dietrich Kuske, Markus Lohrey:
Hamiltonicity of automatic graphs. IFIP TCS 2008: 445-459 - [e2]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [e1]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008. Dagstuhl Seminar Proceedings 08261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i7]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - [i6]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Executive Summary - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - [i5]Dietrich Kuske, Markus Lohrey:
Automatic structures of bounded degree revisited. CoRR abs/0810.4998 (2008) - 2007
- [j15]Markus Lohrey, Nicole Ondrusch:
Inverse monoids: Decidability and complexity of algebraic questions. Inf. Comput. 205(8): 1212-1234 (2007) - [c30]Markus Lohrey, Saul Schleimer:
Efficient Computation in Groups Via Compression. CSR 2007: 249-258 - [c29]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete. FoSSaCS 2007: 198-212 - [c28]Markus Lohrey, Benjamin Steinberg:
The submonoid and rational subset membership problems for graph groups. LATA 2007: 367-378 - [i4]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i3]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i2]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse is 2EXP-complete. Algorithmic-Logical Theory of Infinite Structures 2007 - [i1]Markus Lohrey:
Application of verification techniques to inverse monoids. Algorithmic-Logical Theory of Infinite Structures 2007 - 2006
- [j14]Dietrich Kuske, Markus Lohrey:
Logical Aspects of Cayley-graphs: the Monoid Case. Int. J. Algebra Comput. 16(2): 307-340 (2006) - [j13]Markus Lohrey:
Word Problems and Membership Problems on Compressed Words. SIAM J. Comput. 35(5): 1210-1240 (2006) - [j12]Markus Lohrey, Sebastian Maneth:
The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2): 196-210 (2006) - [c27]Stefan Göller, Markus Lohrey:
Infinite State Model-Checking of Propositional Dynamic Logics. CSL 2006: 349-364 - [c26]Dietrich Kuske, Markus Lohrey:
First-Order and Counting Theories of omega-Automatic Structures. FoSSaCS 2006: 322-336 - [c25]Markus Lohrey, Géraud Sénizergues:
Theories of HNN-Extensions and Amalgamated Products. ICALP (2) 2006: 504-515 - [c24]Dietrich Kuske, Markus Lohrey:
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. LICS 2006: 91-100 - [c23]Volker Diekert, Markus Lohrey, Alexander Miller:
Partially Commutative Inverse Monoids. MFCS 2006: 292-304 - [c22]Yury Lifshits, Markus Lohrey:
Querying and Embedding Compressed Texts. MFCS 2006: 681-692 - 2005
- [j11]Dietrich Kuske, Markus Lohrey:
Logical aspects of Cayley-graphs: the group case. Ann. Pure Appl. Log. 131(1-3): 263-286 (2005) - [j10]Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns:
Axiomatising divergence. Inf. Comput. 203(2): 115-144 (2005) - [j9]Markus Lohrey:
Decidability and complexity in automatic monoids. Int. J. Found. Comput. Sci. 16(4): 707-722 (2005) - [j8]Markus Lohrey, Holger Petersen:
Complexity results for prefix grammars. RAIRO Theor. Informatics Appl. 39(2): 391-401 (2005) - [j7]Dietrich Kuske, Markus Lohrey:
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38(1): 39-81 (2005) - [c21]Giorgio Busatto, Markus Lohrey, Sebastian Maneth:
Efficient Memory Representation of XML Documents. DBPL 2005: 199-216 - [c20]Stefan Göller, Markus Lohrey:
Fixpoint Logics on Hierarchical Structures. FSTTCS 2005: 483-494 - [c19]Markus Lohrey:
Model-Checking Hierarchical Structures. LICS 2005: 168-177 - [c18]Markus Lohrey, Nicole Ondrusch:
Inverse Monoids: Decidability and Complexity of Algebraic Questions. MFCS 2005: 664-675 - [c17]Markus Lohrey, Sebastian Maneth:
Tree Automata and XPath on Compressed Trees. CIAA 2005: 225-237 - 2004
- [j6]Markus Lohrey, Anca Muscholl:
Bounded MSC communication. Inf. Comput. 189(2): 160-181 (2004) - [j5]Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. Theory Comput. Syst. 37(1): 133-156 (2004) - [c16]Markus Lohrey:
Decidability and Complexity in Automatic Monoids. Developments in Language Theory 2004: 308-320 - [c15]Markus Lohrey:
Word Problems on Compressed Words. ICALP 2004: 906-918 - 2003
- [b2]Markus Lohrey:
Computational and logical aspects of infinite monoids. University of Stuttgart, Germany, 2003, pp. 1-13 - [j4]Markus Lohrey:
Realizability of high-level message sequence charts: closing the gaps. Theor. Comput. Sci. 309(1-3): 529-554 (2003) - [c14]Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. FSTTCS 2003: 156-167 - [c13]Markus Lohrey:
Automatic Structures of Bounded Degree. LPAR 2003: 346-360 - [c12]Dietrich Kuske, Markus Lohrey:
Decidable Theories of Cayley-Graphs. STACS 2003: 463-474 - 2002
- [j3]Volker Diekert, Markus Lohrey:
A Note on The Existential Theory of Equations in Plain Groups. Int. J. Algebra Comput. 12(1-2): 1-7 (2002) - [c11]Markus Lohrey:
Safe Realizability of High-Level Message Sequence Charts. CONCUR 2002: 177-192 - [c10]Markus Lohrey, Anca Muscholl:
Bounded MSC Communication. FoSSaCS 2002: 295-309 - [c9]Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns:
Axiomatising Divergence. ICALP 2002: 585-596 - [c8]Dietrich Kuske, Markus Lohrey:
On the Theory of One-Step Rewriting in Trace Monoids. ICALP 2002: 752-763 - [c7]Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. STACS 2002: 501-512 - 2001
- [j2]Markus Lohrey:
Confluence Problems for Trace Rewriting Systems. Inf. Comput. 170(1): 1-25 (2001) - [c6]Markus Lohrey:
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. MFCS 2001: 500-511 - [c5]Markus Lohrey:
On the Parallel Complexity of Tree Automata. RTA 2001: 201-215 - 2000
- [c4]Markus Lohrey:
Word Problems and Confluence Problems for Restricted Semi-Thue Systems. RTA 2000: 172-186
1990 – 1999
- 1999
- [b1]Markus Lohrey:
Das Konfluenzproblem für Spurersetzungssysteme. Universität Stuttgart, 1999, pp. 1-140 - [c3]Markus Lohrey:
Complexity Results for Confluence Problems. MFCS 1999: 114-124 - 1998
- [j1]Markus Lohrey:
NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars. Acta Cybern. 13(3): 209-224 (1998) - [c2]Holger Hermanns, Markus Lohrey:
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). CONCUR 1998: 237-252 - [c1]Markus Lohrey:
On the Confluence of Trace Rewriting Systems. FSTTCS 1998: 319-330
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-20 23:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
