Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Markus Lohrey
2010 – today
- 2013
[j36]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The isomorphism problem for ω-automatic trees. Ann. Pure Appl. Logic 164(1): 30-48 (2013)- [j35]Markus Lohrey, Christian Mathissen: Isomorphism of regular trees and words. Inf. Comput. 224: 71-105 (2013)
- [j34]Markus Lohrey, Sebastian Maneth, Roy Mennicke: XML tree structure compression using RePair. Inf. Syst. 38(8): 1150-1167 (2013)
- [j33]Stefan Göller, Markus Lohrey: Branching-Time Model Checking of One-Counter Processes and Timed Automata. SIAM J. Comput. 42(3): 884-923 (2013)
- [c57]Claudia Carapelle, Alexander Kartzow, Markus Lohrey: Satisfiability of CTL* with Constraints. CONCUR 2013: 455-469
- [c56]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche: Rational Subsets and Submonoids of Wreath Products. ICALP (2) 2013: 361-372
- [c55]
- [c54]Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann: Compression of Rewriting Systems for Termination Analysis. RTA 2013: 97-112
- [i13]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche: Rational Subsets and Submonoids of Wreath Products. CoRR abs/1302.2455 (2013)
- [i12]Claudia Carapelle, Alexander Kartzow, Markus Lohrey: Satisfiability of CTL* with constraints. CoRR abs/1306.0814 (2013)
- [i11]
- [i10]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Noeth: XML Compression via DAGs. CoRR abs/1309.5927 (2013)
- 2012
- [j32]Markus Lohrey: Algorithmics on SLP-compressed strings: A survey. Groups Complexity Cryptology 4(2): 241-299 (2012)
- [j31]Niko Haubold, Markus Lohrey, Christian Mathissen: Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups. IJAC 22(8) (2012)
- [j30]
- [j29]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5): 1651-1669 (2012)
- [c53]
- [c52]Volker Diekert, Jonathan Kausch, Markus Lohrey: Logspace Computations in Graph Groups and Coxeter Groups. LATIN 2012: 243-254
- [c51]Stefan Göller, Jean Christoph Jung, Markus Lohrey: The Complexity of Decomposing Modal and First-Order Theories. LICS 2012: 325-334
- [i9]Alexander Kartzow, Jiamou Liu, Markus Lohrey: Tree-Automatic Well-Founded Trees. CoRR abs/1201.5495 (2012)
- 2011
- [j28]
- [j27]Dietrich Kuske, Markus Lohrey: Automatic structures of bounded degree revisited. J. Symb. Log. 76(4): 1352-1380 (2011)
- [j26]Stefan Göller, Markus Lohrey: Fixpoint Logics over Hierarchical Structures. Theory Comput. Syst. 48(1): 93-131 (2011)
- [j25]Markus Lohrey, Benjamin Steinberg: Tilings and Submonoids of Metabelian Groups. Theory Comput. Syst. 48(2): 411-427 (2011)
- [j24]Niko Haubold, Markus Lohrey: Compressed Word Problems in HNN-extensions and Amalgamated Products. Theory Comput. Syst. 49(2): 283-305 (2011)
- [c50]Markus Lohrey, Christian Mathissen: Compressed Membership in Automata with Compressed Labels. CSR 2011: 275-288
- [c49]Markus Lohrey, Sebastian Maneth, Roy Mennicke: Tree Structure Compression with RePair. DCC 2011: 353-362
- [c48]Stefan Göller, Markus Lohrey: The First-Order Theory of Ground Tree Rewrite Graphs. FSTTCS 2011: 276-287
- [c47]
- [c46]
- [i8]Markus Lohrey, Christian Mathissen: Isomorphism of regular trees and words. CoRR abs/1102.2782 (2011)
- [i7]Stefan Göller, Markus Lohrey: The First-Order Theory of Ground Tree Rewrite Graphs. CoRR abs/1107.0919 (2011)
- 2010
- [j23]Markus Lohrey: Compressed Membership Problems for Regular Expressions and Hierarchical Automata. Int. J. Found. Comput. Sci. 21(5): 817-841 (2010)
- [j22]Dietrich Kuske, Markus Lohrey: Some natural decision problems in automatic graphs. J. Symb. Log. 75(2): 678-710 (2010)
- [c45]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem for omega-Automatic Trees. CSL 2010: 396-410
- [c44]Niko Haubold, Markus Lohrey, Christian Mathissen: Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. Developments in Language Theory 2010: 218-230
- [c43]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem on Classes of Automatic Structures. LICS 2010: 160-169
- [c42]Stefan Göller, Markus Lohrey: Branching-time Model Checking of One-counter Processes. STACS 2010: 405-416
- [i6]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem On Classes of Automatic Structures. CoRR abs/1001.2086 (2010)
- [i5]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem for omega-Automatic Trees. CoRR abs/1004.0610 (2010)
- [i4]Markus Lohrey, Sebastian Maneth, Roy Mennicke: Tree structure compression with RePair. CoRR abs/1007.5406 (2010)
2000 – 2009
- 2009
- [j21]Stefan Göller, Markus Lohrey, Carsten Lutz: PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Log. 74(1): 279-314 (2009)
- [c41]
- [c40]Niko Haubold, Markus Lohrey: Compressed Word Problems in HNN-Extensions and Amalgamated Products. CSR 2009: 237-249
- [c39]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter Reduction in Grammar-Compressed Trees. FOSSACS 2009: 212-226
- [i3]Stefan Göller, Markus Lohrey: Branching-time model checking of one-counter processes. CoRR abs/0909.1102 (2009)
- [i2]Stefan Göller, Markus Lohrey: Branching-time model checking of one-counter processes. CoRR abs/0912.4117 (2009)
- 2008
- [j20]Markus Lohrey, Géraud Sénizergues: Rational Subsets in HNN-Extensions and Amalgamated Products. IJAC 18(1): 111-163 (2008)
- [j19]Volker Diekert, Nicole Ondrusch, Markus Lohrey: Algorithmic Problems on Inverse Monoids over Virtually Free Groups. IJAC 18(1): 181-208 (2008)
- [j18]
- [j17]Giorgio Busatto, Markus Lohrey, Sebastian Maneth: Efficient memory representation of XML document trees. Inf. Syst. 33(4-5): 456-474 (2008)
- [j16]Dietrich Kuske, Markus Lohrey: First-order and counting theories of omega-automatic structures. J. Symb. Log. 73(1): 129-150 (2008)
- [c38]
- [c37]Dietrich Kuske, Markus Lohrey: Euler paths and ends in automatic and recursive graphs. AFL 2008: 245-256
- [c36]
- [c35]
- [e1]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi (Eds.): Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- [i1]Dietrich Kuske, Markus Lohrey: Automatic structures of bounded degree revisited. CoRR abs/0810.4998 (2008)
- 2007
- [j15]Markus Lohrey, Nicole Ondrusch: Inverse monoids: Decidability and complexity of algebraic questions. Inf. Comput. 205(8): 1212-1234 (2007)
- [c34]
- [c33]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- [c32]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- [c31]Stefan Göller, Markus Lohrey, Carsten Lutz: PDL with Intersection and Converse is 2EXP-complete. Algorithmic-Logical Theory of Infinite Structures 2007
- [c30]Markus Lohrey: Application of verification techniques to inverse monoids. Algorithmic-Logical Theory of Infinite Structures 2007
- [c29]Stefan Göller, Markus Lohrey, Carsten Lutz: PDL with Intersection and Converse Is 2 EXP-Complete. FoSSaCS 2007: 198-212
- [c28]Markus Lohrey, Benjamin Steinberg: The submonoid and rational subset membership problems for graph groups. LATA 2007: 367-378
- 2006
- [j14]Dietrich Kuske, Markus Lohrey: Logical Aspects of Cayley-graphs: the Monoid Case. IJAC 16(2): 307-340 (2006)
- [j13]Markus Lohrey: Word Problems and Membership Problems on Compressed Words. SIAM J. Comput. 35(5): 1210-1240 (2006)
- [j12]Markus Lohrey, Sebastian Maneth: The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2): 196-210 (2006)
- [c27]Stefan Göller, Markus Lohrey: Infinite State Model-Checking of Propositional Dynamic Logics. CSL 2006: 349-364
- [c26]Dietrich Kuske, Markus Lohrey: First-Order and Counting Theories of omega-Automatic Structures. FoSSaCS 2006: 322-336
- [c25]Markus Lohrey, Géraud Sénizergues: Theories of HNN-Extensions and Amalgamated Products. ICALP (2) 2006: 504-515
- [c24]Dietrich Kuske, Markus Lohrey: Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. LICS 2006: 91-100
- [c23]Volker Diekert, Markus Lohrey, Alexander Miller: Partially Commutative Inverse Monoids. MFCS 2006: 292-304
- [c22]
- 2005
- [j11]Dietrich Kuske, Markus Lohrey: Logical aspects of Cayley-graphs: the group case. Ann. Pure Appl. Logic 131(1-3): 263-286 (2005)
- [j10]Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns: Axiomatising divergence. Inf. Comput. 203(2): 115-144 (2005)
- [j9]Markus Lohrey: Decidability and complexity in automatic monoids. Int. J. Found. Comput. Sci. 16(4): 707-722 (2005)
- [j8]
- [j7]Dietrich Kuske, Markus Lohrey: Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38(1): 39-81 (2005)
- [c21]Giorgio Busatto, Markus Lohrey, Sebastian Maneth: Efficient Memory Representation of XML Documents. DBPL 2005: 199-216
- [c20]
- [c19]
- [c18]Markus Lohrey, Nicole Ondrusch: Inverse Monoids: Decidability and Complexity of Algebraic Questions. MFCS 2005: 664-675
- [c17]
- 2004
- [j6]
- [j5]Volker Diekert, Markus Lohrey: Existential and Positive Theories of Equations in Graph Products. Theory Comput. Syst. 37(1): 133-156 (2004)
- [c16]Markus Lohrey: Decidability and Complexity in Automatic Monoids. Developments in Language Theory 2004: 308-320
- [c15]
- 2003
- [j4]Markus Lohrey: Realizability of high-level message sequence charts: closing the gaps. Theor. Comput. Sci. 309(1-3): 529-554 (2003)
- [c14]
- [c13]
- [c12]
- 2002
- [j3]Volker Diekert, Markus Lohrey: A Note on The Existential Theory of Equations in Plain Groups. IJAC 12(1-2): 1-7 (2002)
- [c11]
- [c10]
- [c9]
- [c8]Dietrich Kuske, Markus Lohrey: On the Theory of One-Step Rewriting in Trace Monoids. ICALP 2002: 752-763
- [c7]Volker Diekert, Markus Lohrey: Existential and Positive Theories of Equations in Graph Products. STACS 2002: 501-512
- 2001
- [j2]
- [c6]
- [c5]
- 2000
- [c4]Markus Lohrey: Word Problems and Confluence Problems for Restricted Semi-Thue Systems. RTA 2000: 172-186
1990 – 1999
- 1999
- [b1]Markus Lohrey: Das Konfluenzproblem für Spurersetzungssysteme. Universität Stuttgart 1999, pp. 1-140
- [c3]
- 1998
- [j1]Markus Lohrey: NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars. Acta Cybern. 13(3): 209-224 (1998)
- [c2]Holger Hermanns, Markus Lohrey: Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). CONCUR 1998: 237-252
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team