Markus Lohrey

From MaRDI portal
Person:269346

Available identifiers

zbMath Open lohrey.markusWikidataQ102236734 ScholiaQ102236734MaRDI QIDQ269346

List of research outcomes

PublicationDate of PublicationType
Knapsack and the power word problem in solvable Baumslag–Solitar groups2023-06-01Paper
Complexity of word problems for HNN-extensions2023-04-21Paper
https://portal.mardi4nfdi.de/entity/Q58755662023-02-03Paper
Balancing straight-line programs for strings and trees2022-12-16Paper
Balancing Straight-line Programs2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50924052022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924802022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892402022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904872022-07-18Paper
Membership Problems in Finite Groups2022-06-23Paper
Complexity of word problems for HNN-extensions2022-05-20Paper
Compression techniques in group theory2022-03-22Paper
Entropy Bounds for Grammar-Based Tree Compressors2022-02-17Paper
Exponent equations in HNN-extensions2022-02-08Paper
Streaming word problems2022-02-08Paper
Closure properties of knapsack semilinear groups2021-10-22Paper
https://portal.mardi4nfdi.de/entity/Q50051132021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50051152021-08-04Paper
Derandomization for sliding window algorithms with strict correctness2021-08-03Paper
https://portal.mardi4nfdi.de/entity/Q50028132021-07-28Paper
The Smallest Grammar Problem Revisited2021-02-22Paper
https://portal.mardi4nfdi.de/entity/Q51446362021-01-19Paper
Largest common prefix of a regular tree language2020-10-23Paper
https://portal.mardi4nfdi.de/entity/Q33041302020-08-05Paper
Knapsack Problems for Wreath Products2020-08-05Paper
A Comparison of Empirical Tree Entropies2020-06-01Paper
Counting problems for parikh images2020-05-26Paper
Grammar-based compression of unranked trees2020-02-27Paper
The complexity of knapsack problems in wreath products2020-02-19Paper
Knapsack and the power word problem in solvable Baumslag-Solitar groups2020-02-07Paper
Largest common prefix of a regular tree language2020-01-30Paper
Universal Tree Source Coding Using Grammar-Based Compression2020-01-28Paper
Knapsack in hyperbolic groups2019-12-27Paper
Circuits and Expressions over Finite Semirings2019-12-16Paper
A Universal Tree Balancing Theorem2019-12-16Paper
Closure properties of knapsack semilinear groups2019-11-28Paper
Derandomization for sliding window algorithms with strict correctness2019-10-22Paper
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems2019-09-30Paper
Size-optimal top dag compression2019-05-10Paper
The power word problem2019-04-17Paper
Grammar-based compression of unranked trees2018-11-28Paper
https://portal.mardi4nfdi.de/entity/Q45532822018-11-02Paper
Knapsack in hyperbolic groups2018-10-23Paper
The smallest grammar problem revisited2018-10-17Paper
Parallel identity testing for skew circuits with big powers and applications2018-10-12Paper
Constant-time tree traversal and subtree equality check for grammar-compressed trees2018-07-25Paper
Compression of Unordered XML Trees2018-07-18Paper
Sliding window algorithms for regular languages2018-06-26Paper
Evaluation of circuits over nilpotent and polycyclic groups2018-05-18Paper
Average Case Analysis of Leaf-Centric Binary Tree Sources2018-04-27Paper
Querying Regular Languages over Sliding Windows2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46366342018-04-19Paper
The Complexity of Knapsack in Graph Groups2018-04-19Paper
Tree compression using string grammars2018-04-11Paper
Knapsack in graph groups2018-03-01Paper
Knapsack in graph groups, HNN-extensions and amalgamated products2018-01-24Paper
Processing succinct matrices and vectors2017-10-20Paper
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints2017-10-20Paper
Path Checking for MTL and TPTL over Data Words2017-10-12Paper
Temporal Logics with Local Constraints (Invited Talk)2017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q52783982017-07-19Paper
On Boolean closed full trios and rational Kripke frames2017-07-17Paper
Constructing small tree grammars and small circuits for formulas2017-05-26Paper
The Complexity of Decomposing Modal and First-Order Theories2017-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 groups2017-04-11Paper
https://portal.mardi4nfdi.de/entity/Q29655072017-03-03Paper
On Boolean closed full trios and rational Kripke frames.2017-03-03Paper
Random presentations and random subgroups: a survey2017-02-07Paper
https://portal.mardi4nfdi.de/entity/Q29583782017-02-01Paper
Approximation of smallest linear tree grammar2016-11-18Paper
The rational subset membership problem for groups: a survey2016-07-29Paper
Tree compression using string grammars2016-05-03Paper
XML compression via directed acyclic graphs2016-04-18Paper
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints2016-04-18Paper
Grammar-Based Tree Compression2015-11-10Paper
Path Checking for MTL and TPTL over Data Words2015-11-10Paper
Equality Testing of Compressed Strings2015-11-04Paper
Compressed Tree Canonization2015-11-04Paper
Evaluating Matrix Circuits2015-10-29Paper
Satisfiability of ECTL* with Tree Constraints2015-10-20Paper
The Complexity of Decomposing Modal and First-Order Theories2015-09-17Paper
Parallel Identity Testing for Skew Circuits with Big Powers and Applications2015-09-16Paper
Rational subsets and submonoids of wreath products.2015-06-09Paper
Rational subsets of unitriangular groups2015-04-21Paper
Processing succinct matrices and vectors2014-06-24Paper
The Compressed Word Problem for Groups2014-03-31Paper
The First-Order Theory of Ground Tree Rewrite Graphs2014-03-24Paper
Algorithmics on SLP-compressed strings: A survey2014-01-30Paper
Logspace Computations in Coxeter Groups and Graph Groups2014-01-03Paper
Branching-Time Model Checking of One-Counter Processes and Timed Automata2013-09-25Paper
The isomorphism problem on classes of automatic structures with transitive relations2013-09-04Paper
Satisfiability of CTL* with Constraints2013-08-12Paper
Rational subsets and submonoids of wreath products.2013-08-07Paper
Tree-Automatic Well-Founded Trees2013-07-09Paper
Isomorphism of regular trees and words2013-06-06Paper
COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS2013-01-30Paper
The isomorphism problem for \(\omega \)-automatic trees2012-11-20Paper
Leaf languages and string compression2012-10-19Paper
The First-Order Theory of Ground Tree Rewrite Graphs2012-08-31Paper
Parameter reduction and automata evaluation for grammar-compressed trees2012-08-17Paper
Tree-Automatic Well-Founded Trees2012-08-14Paper
Logspace Computations in Graph Groups and Coxeter Groups2012-06-29Paper
Model-checking hierarchical structures2012-05-11Paper
Branching-time model checking of one-counter processes2012-01-23Paper
Automatic structures of bounded degree revisited2011-12-23Paper
Compressed word problems in HNN-extensions and amalgamated products2011-10-11Paper
Compressed Word Problems for Inverse Monoids2011-08-17Paper
Leaf languages and string compression2011-07-08Paper
Isomorphism of Regular Trees and Words2011-07-07Paper
Compressed Membership in Automata with Compressed Labels2011-06-17Paper
Fixpoint logics over hierarchical structures2011-04-01Paper
Tilings and submonoids of metabelian groups.2011-03-30Paper
Submonoids and rational subsets of groups with infinitely many ends.2010-11-18Paper
COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA2010-11-11Paper
The Isomorphism Problem for ω-Automatic Trees2010-09-03Paper
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups2010-08-31Paper
Some natural decision problems in automatic graphs2010-06-24Paper
An automata theoretic approach to the generalized word problem in graphs of groups2010-03-08Paper
https://portal.mardi4nfdi.de/entity/Q34081492010-02-24Paper
Automatic Structures of Bounded Degree Revisited2009-11-12Paper
Compressed Word Problems in HNN-Extensions and Amalgamated Products2009-08-18Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
Parameter Reduction in Grammar-Compressed Trees2009-03-31Paper
PDL with intersection and converse: satisfiability and infinite-state model checking2009-03-25Paper
Infinite State Model-Checking of Propositional Dynamic Logics2009-03-12Paper
Partially commutative inverse monoids.2008-12-02Paper
The submonoid and rational subset membership problems for graph groups.2008-10-06Paper
WORD EQUATIONS OVER GRAPH PRODUCTS2008-08-26Paper
Efficient Computation in Groups Via Compression2008-06-03Paper
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS2008-05-20Paper
ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS2008-05-20Paper
First-order and counting theories ofω-automatic structures2008-05-08Paper
Theories of HNN-Extensions and Amalgamated Products2007-09-11Paper
PDL with Intersection and Converse Is 2EXP-Complete2007-09-07Paper
Querying and Embedding Compressed Texts2007-09-05Paper
Partially Commutative Inverse Monoids2007-09-05Paper
Inverse monoids: decidability and complexity of algebraic questions.2007-08-23Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
When Is a Graph Product of Groups Virtually-Free?2007-03-30Paper
The complexity of tree automata and XPath on grammar-compressed trees2007-01-09Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Implementation and Application of Automata2006-11-13Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Database Programming Languages2006-10-20Paper
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE2006-08-14Paper
Word Problems and Membership Problems on Compressed Words2006-06-01Paper
Axiomatising divergence2006-01-10Paper
Developments in Language Theory2005-12-22Paper
Automata, Languages and Programming2005-08-24Paper
DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS2005-08-03Paper
Complexity results for prefix grammars2005-07-13Paper
Decidable first-order theories of one-step rewriting in trace monoids2005-02-24Paper
Logical aspects of Cayley-graphs: the group case2005-01-31Paper
Existential and positive theories of equations in graph products2005-01-25Paper
Realizability of high-level message sequence charts: closing the gaps2004-10-27Paper
Bounded MSC communication2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q47368662004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47371912004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47372052004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47382332004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44186732003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44844872003-06-12Paper
Confluence problems for trace rewriting systems2003-01-14Paper
A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS2002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47791682002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q27788792002-03-21Paper
https://portal.mardi4nfdi.de/entity/Q27238992001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q49418942000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42691631999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42519171999-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Markus Lohrey