Markus Lohrey

From MaRDI portal
(Redirected from Person:269346)



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
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
scientific article; zbMATH DE number 7561687 (Why is no real title available?)
(available as arXiv preprint)
2022-07-21Paper
scientific article; zbMATH DE number 7561757 (Why is no real title available?)
(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
scientific article; zbMATH DE number 7559146 (Why is no real title available?)
(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
Average case analysis of leaf-centric binary tree sources2021-08-04Paper
Sliding windows over context-free languages2021-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
Knapsack problems for wreath products
(available as arXiv preprint)
2020-08-05Paper
Automata theory on sliding windows
(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
Processing succinct matrices and vectors
Theory of Computing Systems
2017-10-20Paper
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
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
On Boolean closed full trios and rational Kripke frames2017-03-03Paper
Approximation of smallest linear tree grammar
(available as arXiv preprint)
2017-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
Path checking for MTL and TPTL over data words
Lecture Notes in Computer Science
2015-11-10Paper
Grammar-Based Tree Compression
Developments in Language Theory
2015-11-10Paper
Equality Testing of Compressed Strings
Lecture Notes in Computer Science
2015-11-04Paper
Compressed tree canonization
Automata, Languages, and Programming
2015-11-04Paper
Evaluating matrix circuits
Lecture Notes in Computer Science
2015-10-29Paper
Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
Lecture Notes in Computer Science
2015-10-20Paper
The Complexity of Decomposing Modal and First-Order Theories
ACM Transactions on Computational Logic
2015-09-17Paper
Parallel identity testing for skew circuits with big powers and applications
Mathematical Foundations of Computer Science 2015
2015-09-16Paper
Rational subsets and submonoids of wreath products.
Information and Computation
2015-06-09Paper
Rational subsets of unitriangular groups.
International Journal of Algebra and Computation
2015-04-21Paper
Processing succinct matrices and vectors
Lecture Notes in Computer Science
2014-06-24Paper
The Compressed Word Problem for Groups
SpringerBriefs in Mathematics
2014-03-31Paper
The first-order theory of ground tree rewrite graphs
Logical Methods in Computer Science
2014-03-24Paper
Algorithmics on SLP-compressed strings: a survey
Groups, Complexity, Cryptology
2014-01-30Paper
Logspace computations in Coxeter groups and graph groups.
Computational and Combinatorial Group Theory and Cryptography
2014-01-03Paper
Branching-time model checking of one-counter processes and timed automata
SIAM Journal on Computing
2013-09-25Paper
The isomorphism problem on classes of automatic structures with transitive relations
Transactions of the American Mathematical Society
2013-09-04Paper
Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
CONCUR 2013 – Concurrency Theory
2013-08-12Paper
Rational subsets and submonoids of wreath products.
Lecture Notes in Computer Science
2013-08-07Paper
Tree-automatic well-founded trees
Logical Methods in Computer Science
2013-07-09Paper
Isomorphism of regular trees and words
Information and Computation
2013-06-06Paper
Compressed decision problems for graph products and applications to (outer) automorphism groups.
International Journal of Algebra and Computation
2013-01-30Paper
The isomorphism problem for \(\omega \)-automatic trees
Annals of Pure and Applied Logic
2012-11-20Paper
Leaf languages and string compression2012-10-19Paper
The first-order theory of ground tree rewrite graphs
(available as arXiv preprint)
2012-08-31Paper
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
2012-08-17Paper
Tree-automatic well-founded trees
Lecture Notes in Computer Science
2012-08-14Paper
Logspace computations in graph groups and Coxeter groups.
LATIN 2012: Theoretical Informatics
2012-06-29Paper
Model-checking hierarchical structures
Journal of Computer and System Sciences
2012-05-11Paper
Branching-time model checking of one-counter processes2012-01-23Paper
Automatic structures of bounded degree revisited
Journal of Symbolic Logic
2011-12-23Paper
Compressed word problems in HNN-extensions and amalgamated products
Theory of Computing Systems
2011-10-11Paper
Compressed word problems for inverse monoids
Mathematical Foundations of Computer Science 2011
2011-08-17Paper
Leaf languages and string compression
Information and Computation
2011-07-08Paper
Isomorphism of regular trees and words
Automata, Languages and Programming
2011-07-07Paper
Compressed membership in automata with compressed labels
Computer Science – Theory and Applications
2011-06-17Paper
Fixpoint logics over hierarchical structures
Theory of Computing Systems
2011-04-01Paper
Tilings and submonoids of metabelian groups.
Theory of Computing Systems
2011-03-30Paper
Submonoids and rational subsets of groups with infinitely many ends.
Journal of Algebra
2010-11-18Paper
Compressed membership problems for regular expressions and hierarchical automata
International Journal of Foundations of Computer Science
2010-11-11Paper
The isomorphism problem for \(\omega \)-automatic trees
Computer Science Logic
2010-09-03Paper
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Developments in Language Theory
2010-08-31Paper
Some natural decision problems in automatic graphs
Journal of Symbolic Logic
2010-06-24Paper
An automata theoretic approach to the generalized word problem in graphs of groups.
Proceedings of the American Mathematical Society
2010-03-08Paper
Automatic structures of bounded degree2010-02-24Paper
Automatic Structures of Bounded Degree Revisited
Computer Science Logic
2009-11-12Paper
Compressed Word Problems in HNN-Extensions and Amalgamated Products
Computer Science - Theory and Applications
2009-08-18Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science
2009-08-06Paper
Parameter Reduction in Grammar-Compressed Trees
Foundations of Software Science and Computational Structures
2009-03-31Paper
PDL with intersection and converse: satisfiability and infinite-state model checking
Journal of Symbolic Logic
2009-03-25Paper
Infinite State Model-Checking of Propositional Dynamic Logics
Computer Science Logic
2009-03-12Paper
Partially commutative inverse monoids.
Semigroup Forum
2008-12-02Paper
The submonoid and rational subset membership problems for graph groups.
Journal of Algebra
2008-10-06Paper
WORD EQUATIONS OVER GRAPH PRODUCTS
International Journal of Algebra and Computation
2008-08-26Paper
Efficient Computation in Groups Via Compression
Computer Science – Theory and Applications
2008-06-03Paper
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
International Journal of Algebra and Computation
2008-05-20Paper
ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
International Journal of Algebra and Computation
2008-05-20Paper
First-order and counting theories ofω-automatic structures
Journal of Symbolic Logic
2008-05-08Paper
Theories of HNN-Extensions and Amalgamated Products
Automata, Languages and Programming
2007-09-11Paper
PDL with Intersection and Converse Is 2EXP-Complete
Foundations of Software Science and Computational Structures
2007-09-07Paper
Querying and Embedding Compressed Texts
Lecture Notes in Computer Science
2007-09-05Paper
Partially Commutative Inverse Monoids
Lecture Notes in Computer Science
2007-09-05Paper
Inverse monoids: decidability and complexity of algebraic questions.
Information and Computation
2007-08-23Paper
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science
2007-05-02Paper
When Is a Graph Product of Groups Virtually-Free?
Communications in Algebra
2007-03-30Paper
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science
2007-01-09Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science
2006-11-14Paper
Implementation and Application of Automata
Lecture Notes in Computer Science
2006-11-13Paper
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science
2006-10-20Paper
Database Programming Languages
Lecture Notes in Computer Science
2006-10-20Paper
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
International Journal of Algebra and Computation
2006-08-14Paper
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
2006-06-01Paper
Axiomatising divergence
Information and Computation
2006-01-10Paper
Developments in Language Theory
Lecture Notes in Computer Science
2005-12-22Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2005-08-24Paper
DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
International Journal of Foundations of Computer Science
2005-08-03Paper
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications
2005-07-13Paper
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications
2005-07-13Paper
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications
2005-07-13Paper
Decidable first-order theories of one-step rewriting in trace monoids
Theory of Computing Systems
2005-02-24Paper
Logical aspects of Cayley-graphs: the group case
Annals of Pure and Applied Logic
2005-01-31Paper
Existential and positive theories of equations in graph products
Theory of Computing Systems
2005-01-25Paper
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
2004-10-27Paper
Bounded MSC communication
Information and Computation
2004-10-04Paper
scientific article; zbMATH DE number 2086668 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2086411 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2086654 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2087438 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 1962836 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1927562 (Why is no real title available?)2003-06-12Paper
Confluence problems for trace rewriting systems
Information and Computation
2003-01-14Paper
A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS
International Journal of Algebra and Computation
2002-12-15Paper
scientific article; zbMATH DE number 1834672 (Why is no real title available?)2002-11-25Paper
scientific article; zbMATH DE number 1722707 (Why is no real title available?)2002-03-21Paper
scientific article; zbMATH DE number 1615237 (Why is no real title available?)2001-07-08Paper
scientific article; zbMATH DE number 1418332 (Why is no real title available?)2000-03-19Paper
scientific article; zbMATH DE number 1354904 (Why is no real title available?)1999-10-31Paper
scientific article; zbMATH DE number 1304995 (Why is no real title available?)1999-06-17Paper
Parameterized Complexity of Factorization Problems
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Markus Lohrey