Travelled to:1 × Austria
1 × Canada
1 × Croatia
1 × Czech Republic
1 × Finland
1 × Germany
1 × Italy
1 × Japan
1 × Latvia
1 × New Zealand
1 × Spain
1 × Switzerland
2 × France
2 × Hungary
2 × Portugal
2 × The Netherlands
2 × USA
4 × United Kingdom
Collaborated with:∅ D.Kuske S.Göller S.Maneth B.Steinberg C.Mathissen J.Liu C.Carapelle G.Sénizergues A.Muscholl S.Feng K.Quaas F.Peternek G.Zetzsche J.C.Jung N.Haubold M.Schmidt-Schauß C.Lutz P.R.D'Argenio H.Hermanns M.Ganardi A.Bau E.Nöth J.Waldmann
Talks about:compress (9) problem (9) tree (8) automat (7) word (6) complex (5) structur (4) theori (4) system (4) membership (3)
Person: Markus Lohrey
DBLP: Lohrey:Markus
Contributed to:
2015
2015
20152013
2013
201220112010201020102009
2009
200820102007
20072006200620062006
2005200520042005200420022002200120002016Wrote 33 papers:
- CSL-2015-CarapelleL #constraints #logic
- Temporal Logics with Local Constraints (CC, ML), pp. 2–13.
- DLT-2015-FengLQ #word
- Path Checking for MTL and TPTL over Data Words (SF, ML, KQ), pp. 326–339.
- DLT-2015-Lohrey #grammarware
- Grammar-Based Tree Compression (ML), pp. 46–57.
- ICALP-v2-2015-LohreyMP
- Compressed Tree Canonization (ML, SM, FP), pp. 337–349.
- ICALP-v2-2013-LohreySZ #set
- Rational Subsets and Submonoids of Wreath Products (ML, BS, GZ), pp. 361–372.
- RTA-2013-BauLNW #analysis #term rewriting #termination
- Compression of Rewriting Systems for Termination Analysis (AB, ML, EN, JW), pp. 97–112.
- LICS-2012-GollerJL #complexity #first-order
- The Complexity of Decomposing Modal and First-Order Theories (SG, JCJ, ML), pp. 325–334.
- ICALP-v2-2011-LohreyM #morphism #word
- Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.
- CSL-2010-KuskeLL #morphism #problem
- The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.
- DLT-2010-HauboldLM #graph #morphism #problem #word
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.
- LICS-2010-KuskeLL #automation #morphism #problem
- The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.
- CSL-2009-KuskeL #automation #bound #revisited
- Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.
- FoSSaCS-2009-LohreyMS #parametricity #reduction
- Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
- AFL-2008-KuskeL #automation #graph #recursion
- Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.
- AFL-2008-Lohrey #problem #revisited
- Compressed membership problems revisited (ML), pp. 31–53.
- AFL-J-2008-Lohrey10 #automaton #problem #regular expression
- Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.
- FoSSaCS-2007-GollerLL
- PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.
- LATA-2007-LohreyS #graph #problem #set
- The submonoid and rational subset membership problems for graph groups (ML, BS), pp. 367–378.
- CSL-2006-GollerL #infinity #logic #model checking
- Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.
- FoSSaCS-2006-KuskeL #first-order
- First-Order and Counting Theories of ω-Automatic Structures (DK, ML), pp. 322–336.
- ICALP-v2-2006-LohreyS
- Theories of HNN-Extensions and Amalgamated Products (ML, GS), pp. 504–515.
- LICS-2006-KuskeL #automaton #logic #monad
- Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
- CIAA-2005-LohreyM #automaton #xpath
- Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.
- LICS-2005-Lohrey #model checking
- Model-Checking Hierarchical Structures (ML), pp. 168–177.
- DLT-2004-Lohrey #automation #complexity #decidability #monad
- Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.
- DLT-J-2004-Lohrey05 #automation #complexity #decidability #monad
- Decidability and complexity in automatic monoids (ML), pp. 707–722.
- ICALP-2004-Lohrey #problem #word
- Word Problems on Compressed Words (ML), pp. 906–918.
- FoSSaCS-2002-LohreyM #bound #communication
- Bounded MSC Communication (ML, AM), pp. 295–309.
- ICALP-2002-KuskeL #formal method #monad #on the
- On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
- ICALP-2002-LohreyDH #axiom
- Axiomatising Divergence (ML, PRD, HH), pp. 585–596.
- RTA-2001-Lohrey #automaton #complexity #on the #parallel
- On the Parallel Complexity of Tree Automata (ML), pp. 201–215.
- RTA-2000-Lohrey #confluence #problem #strict #word
- Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.
- CSL-2016-GanardiGL #bisimulation #complexity #finite #on the #parallel
- On the Parallel Complexity of Bisimulation on Finite Systems (MG, SG, ML), p. 17.