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
- 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]