Markus Lohrey

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Parameterized Complexity of Factorization Problems
(available as arXiv preprint)
N/APaper
FO-query enumeration over SLP-compressed structures of bounded degree2026-08-05Paper
Parameterized complexity of factorization problems
Discrete Mathematics and Theoretical Computer Science. DMTCS
2026-06-04Paper
Streaming in graph products2026-05-12Paper
Subgroup membership in GL\((2,\mathbb{Z})\)2026-04-21Paper
MSO-enumeration over SLP-compressed unranked forests
TheoretiCS
2026-03-23Paper
The complexity of knapsack problems in wreath products2026-03-18Paper
Finding cycle types in permutation groups with few generators2026-01-28Paper
Balancing straight-line programs2025-08-12Paper
Parallel complexity in group theory2025-05-27Paper
Regular languages in the sliding window model
TheoretiCS
2025-05-06Paper
Membership problems in finite groups
Journal of Algebra
2025-04-22Paper
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
ACM Transactions on Computation Theory
2025-02-21Paper
Membership problems in infinite groups2025-02-07Paper
Exponent equations in HNN-extensions2025-01-17Paper
On the complexity of diameter and related problems in permutation groups2024-11-14Paper
Compressed decision problems in hyperbolic groups
Groups, Geometry, and Dynamics
2024-10-15Paper
Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\)
Theory of Computing Systems
2024-10-07Paper
Low-latency sliding window algorithms for formal languages2024-09-12Paper
Exponent equations in HNN-extensions
Journal of Groups, Complexity, Cryptology
2024-09-10Paper
Membership problems in finite groups2024-08-06Paper
Streaming word problems2024-08-06Paper
The power word problem in graph products
Theory of Computing Systems
2024-07-29Paper
Knapsack and the power word problem in solvable Baumslag–Solitar groups
International Journal of Algebra and Computation
2023-06-01Paper
Complexity of word problems for HNN-extensions
Journal of Computer and System Sciences
2023-04-21Paper
scientific article; zbMATH DE number 7650239 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
Balancing straight-line programs for strings and trees2022-12-16Paper
Balancing Straight-line Programs
Journal of the ACM
2022-12-08Paper
The power word problem
(available as arXiv preprint)
2022-07-21Paper
Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems
(available as arXiv preprint)
2022-07-21Paper
scientific article; zbMATH DE number 7559438 (Why is no real title available?)
(available as arXiv preprint)
2022-07-18Paper
Compressed decision problems in hyperbolic groups
(available as arXiv preprint)
2022-07-18Paper
Membership Problems in Finite Groups2022-06-23Paper
Complexity of word problems for HNN-extensions
Fundamentals of Computation Theory
2022-05-20Paper
Compression techniques in group theory2022-03-22Paper
Entropy Bounds for Grammar-Based Tree Compressors
IEEE Transactions on Information Theory
2022-02-17Paper
Exponent equations in HNN-extensions2022-02-08Paper
Streaming word problems2022-02-08Paper
Closure properties of knapsack semilinear groups
Journal of Algebra
2021-10-22Paper
Sliding windows over context-free languages2021-08-04Paper
Average case analysis of leaf-centric binary tree sources2021-08-04Paper
Derandomization for sliding window algorithms with strict correctness
Theory of Computing Systems
2021-08-03Paper
Randomized sliding window algorithms for regular languages
(available as arXiv preprint)
2021-07-28Paper
The Smallest Grammar Problem Revisited
IEEE Transactions on Information Theory
2021-02-22Paper
scientific article; zbMATH DE number 7297838 (Why is no real title available?)2021-01-19Paper
Largest common prefix of a regular tree language
Journal of Computer and System Sciences
2020-10-23Paper
Automata theory on sliding windows
(available as arXiv preprint)
2020-08-05Paper
Knapsack problems for wreath products
(available as arXiv preprint)
2020-08-05Paper
A Comparison of Empirical Tree Entropies2020-06-01Paper
Counting problems for Parikh images2020-05-26Paper
Grammar-based compression of unranked trees
Theory of Computing Systems
2020-02-27Paper
The complexity of knapsack problems in wreath products2020-02-19Paper
Knapsack and the power word problem in solvable Baumslag-Solitar groups
(available as arXiv preprint)
2020-02-07Paper
Largest common prefix of a regular tree language
Fundamentals of Computation Theory
2020-01-30Paper
Universal Tree Source Coding Using Grammar-Based Compression
IEEE Transactions on Information Theory
2020-01-28Paper
Knapsack in hyperbolic groups
Journal of Algebra
2019-12-27Paper
Circuits and Expressions over Finite Semirings
ACM Transactions on Computation Theory
2019-12-16Paper
A universal tree balancing theorem
ACM Transactions on Computation Theory
2019-12-16Paper
Closure properties of knapsack semilinear groups
(available as arXiv preprint)
2019-11-28Paper
Derandomization for sliding window algorithms with strict correctness
Computer Science – Theory and Applications
2019-10-22Paper
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
(available as arXiv preprint)
2019-09-30Paper
Size-optimal top dag compression
Information Processing Letters
2019-05-10Paper
The power word problem
(available as arXiv preprint)
2019-04-17Paper
Grammar-based compression of unranked trees
Lecture Notes in Computer Science
2018-11-28Paper
scientific article; zbMATH DE number 6970796 (Why is no real title available?)
(available as arXiv preprint)
2018-11-02Paper
Knapsack in hyperbolic groups
Lecture Notes in Computer Science
2018-10-23Paper
The smallest grammar problem revisited
(available as arXiv preprint)
2018-10-17Paper
Parallel identity testing for skew circuits with big powers and applications
International Journal of Algebra and Computation
2018-10-12Paper
Constant-time tree traversal and subtree equality check for grammar-compressed trees
Algorithmica
2018-07-25Paper
Compression of unordered XML trees2018-07-18Paper
Sliding window algorithms for regular languages2018-06-26Paper
Evaluation of circuits over nilpotent and polycyclic groups
Algorithmica
2018-05-18Paper
Average Case Analysis of Leaf-Centric Binary Tree Sources2018-04-27Paper
Querying regular languages over sliding windows2018-04-19Paper
Circuit evaluation for finite semirings
(available as arXiv preprint)
2018-04-19Paper
The Complexity of Knapsack in Graph Groups
(available as arXiv preprint)
2018-04-19Paper
Tree compression using string grammars
Algorithmica
2018-04-11Paper
Knapsack in graph groups
Theory of Computing Systems
2018-03-01Paper
Knapsack in graph groups, HNN-extensions and amalgamated products
(available as arXiv preprint)
2018-01-24Paper
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
Theory of Computing Systems
2017-10-20Paper
Processing succinct matrices and vectors
Theory of Computing Systems
2017-10-20Paper
Path checking for MTL and TPTL over data words
Logical Methods in Computer Science
2017-10-12Paper
Temporal logics with local constraints (invited talk)2017-08-31Paper
On the parallel complexity of bisimulation on finite systems2017-07-19Paper
On Boolean closed full trios and rational Kripke frames
Theory of Computing Systems
2017-07-17Paper
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences
2017-05-26Paper
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences
2017-05-26Paper
The complexity of decomposing modal and first-order theories
2012 27th Annual IEEE Symposium on Logic in Computer Science
2017-05-16Paper
Constructing small tree grammars and small circuits for formulas2017-04-25Paper
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
Algebra and Computer Science
2017-04-11Paper
Approximation of smallest linear tree grammar
(available as arXiv preprint)
2017-03-03Paper
On Boolean closed full trios and rational Kripke frames2017-03-03Paper
Random presentations and random subgroups: a survey
(available as arXiv preprint)
2017-02-07Paper
Compression of rewriting systems for termination analysis2017-02-01Paper
Approximation of smallest linear tree grammar
Information and Computation
2016-11-18Paper
The rational subset membership problem for groups: a survey
Groups St Andrews 2013
2016-07-29Paper
Tree compression using string grammars
Lecture Notes in Computer Science
2016-05-03Paper
XML compression via directed acyclic graphs
Theory of Computing Systems
2016-04-18Paper
XML compression via directed acyclic graphs
Theory of Computing Systems
2016-04-18Paper
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
Journal of Computer and System Sciences
2016-04-18Paper
Grammar-Based Tree Compression
Developments in Language Theory
2015-11-10Paper
Path checking for MTL and TPTL over data words
Lecture Notes in Computer Science
2015-11-10Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Markus Lohrey