| 2009 |
|---|
| 56 | EE | Markus Lohrey,
Sebastian Maneth,
Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees.
FOSSACS 2009: 212-226 |
| 2008 |
|---|
| 55 | | Rod Downey,
Bakhadyr Khoussainov,
Dietrich Kuske,
Markus Lohrey,
Moshe Y. Vardi:
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 54 | EE | Markus Lohrey:
Leaf languages and string compression.
FSTTCS 2008 |
| 53 | EE | Dietrich Kuske,
Markus Lohrey:
Hamiltonicity of automatic graphs.
IFIP TCS 2008: 445-459 |
| 52 | EE | Dietrich Kuske,
Markus Lohrey:
Automatic structures of bounded degree revisited
CoRR abs/0810.4998: (2008) |
| 51 | EE | Markus Lohrey,
Géraud Sénizergues:
Rational Subsets in HNN-Extensions and Amalgamated Products.
IJAC 18(1): 111-163 (2008) |
| 50 | EE | Volker Diekert,
Nicole Ondrusch,
Markus Lohrey:
Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
IJAC 18(1): 181-208 (2008) |
| 49 | EE | Volker Diekert,
Markus Lohrey:
Word Equations over Graph Products.
IJAC 18(3): 493-533 (2008) |
| 48 | EE | Giorgio Busatto,
Markus Lohrey,
Sebastian Maneth:
Efficient memory representation of XML document trees.
Inf. Syst. 33(4-5): 456-474 (2008) |
| 2007 |
|---|
| 47 | EE | 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 |
| 46 | EE | 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 |
| 45 | EE | Markus Lohrey:
Application of verification techniques to inverse monoids.
Algorithmic-Logical Theory of Infinite Structures 2007 |
| 44 | EE | Stefan Göller,
Markus Lohrey,
Carsten Lutz:
PDL with Intersection and Converse is 2EXP-complete.
Algorithmic-Logical Theory of Infinite Structures 2007 |
| 43 | EE | Markus Lohrey,
Saul Schleimer:
Efficient Computation in Groups Via Compression.
CSR 2007: 249-258 |
| 42 | EE | Stefan Göller,
Markus Lohrey,
Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete.
FoSSaCS 2007: 198-212 |
| 41 | EE | Markus Lohrey,
Nicole Ondrusch:
Inverse monoids: Decidability and complexity of algebraic questions.
Inf. Comput. 205(8): 1212-1234 (2007) |
| 2006 |
|---|
| 40 | EE | Stefan Göller,
Markus Lohrey:
Infinite State Model-Checking of Propositional Dynamic Logics.
CSL 2006: 349-364 |
| 39 | EE | Dietrich Kuske,
Markus Lohrey:
First-Order and Counting Theories of omega-Automatic Structures.
FoSSaCS 2006: 322-336 |
| 38 | EE | Markus Lohrey,
Géraud Sénizergues:
Theories of HNN-Extensions and Amalgamated Products.
ICALP (2) 2006: 504-515 |
| 37 | EE | Dietrich Kuske,
Markus Lohrey:
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.
LICS 2006: 91-100 |
| 36 | EE | Volker Diekert,
Markus Lohrey,
Alexander Miller:
Partially Commutative Inverse Monoids.
MFCS 2006: 292-304 |
| 35 | EE | Yury Lifshits,
Markus Lohrey:
Querying and Embedding Compressed Texts.
MFCS 2006: 681-692 |
| 34 | EE | Dietrich Kuske,
Markus Lohrey:
Logical Aspects of Cayley-graphs: the Monoid Case.
IJAC 16(2): 307-340 (2006) |
| 33 | EE | Markus Lohrey:
Word Problems and Membership Problems on Compressed Words.
SIAM J. Comput. 35(5): 1210-1240 (2006) |
| 32 | EE | Markus Lohrey,
Sebastian Maneth:
The complexity of tree automata and XPath on grammar-compressed trees.
Theor. Comput. Sci. 363(2): 196-210 (2006) |
| 2005 |
|---|
| 31 | EE | Markus Lohrey,
Sebastian Maneth:
Tree Automata and XPath on Compressed Trees.
CIAA 2005: 225-237 |
| 30 | EE | Giorgio Busatto,
Markus Lohrey,
Sebastian Maneth:
Efficient Memory Representation of XML Documents.
DBPL 2005: 199-216 |
| 29 | EE | Stefan Göller,
Markus Lohrey:
Fixpoint Logics on Hierarchical Structures.
FSTTCS 2005: 483-494 |
| 28 | EE | Markus Lohrey:
Model-Checking Hierarchical Structures.
LICS 2005: 168-177 |
| 27 | EE | Markus Lohrey,
Nicole Ondrusch:
Inverse Monoids: Decidability and Complexity of Algebraic Questions.
MFCS 2005: 664-675 |
| 26 | EE | Dietrich Kuske,
Markus Lohrey:
Logical aspects of Cayley-graphs: the group case.
Ann. Pure Appl. Logic 131(1-3): 263-286 (2005) |
| 25 | EE | Markus Lohrey,
Pedro R. D'Argenio,
Holger Hermanns:
Axiomatising divergence.
Inf. Comput. 203(2): 115-144 (2005) |
| 24 | EE | Markus Lohrey:
Decidability and complexity in automatic monoids.
Int. J. Found. Comput. Sci. 16(4): 707-722 (2005) |
| 23 | EE | Dietrich Kuske,
Markus Lohrey:
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.
Theory Comput. Syst. 38(1): 39-81 (2005) |
| 2004 |
|---|
| 22 | EE | Markus Lohrey:
Decidability and Complexity in Automatic Monoids.
Developments in Language Theory 2004: 308-320 |
| 21 | EE | Markus Lohrey:
Word Problems on Compressed Words.
ICALP 2004: 906-918 |
| 20 | EE | Markus Lohrey,
Anca Muscholl:
Bounded MSC communication.
Inf. Comput. 189(2): 160-181 (2004) |
| 19 | EE | Volker Diekert,
Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products.
Theory Comput. Syst. 37(1): 133-156 (2004) |
| 2003 |
|---|
| 18 | EE | Volker Diekert,
Markus Lohrey:
Word Equations over Graph Products.
FSTTCS 2003: 156-167 |
| 17 | EE | Markus Lohrey:
Automatic Structures of Bounded Degree.
LPAR 2003: 346-360 |
| 16 | EE | Dietrich Kuske,
Markus Lohrey:
Decidable Theories of Cayley-Graphs.
STACS 2003: 463-474 |
| 15 | EE | Markus Lohrey:
Realizability of high-level message sequence charts: closing the gaps.
Theor. Comput. Sci. 309(1-3): 529-554 (2003) |
| 2002 |
|---|
| 14 | EE | Markus Lohrey:
Safe Realizability of High-Level Message Sequence Charts.
CONCUR 2002: 177-192 |
| 13 | EE | Markus Lohrey,
Anca Muscholl:
Bounded MSC Communication.
FoSSaCS 2002: 295-309 |
| 12 | EE | Markus Lohrey,
Pedro R. D'Argenio,
Holger Hermanns:
Axiomatising Divergence.
ICALP 2002: 585-596 |
| 11 | EE | Dietrich Kuske,
Markus Lohrey:
On the Theory of One-Step Rewriting in Trace Monoids.
ICALP 2002: 752-763 |
| 10 | EE | Volker Diekert,
Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products.
STACS 2002: 501-512 |
| 9 | EE | Volker Diekert,
Markus Lohrey:
A Note on The Existential Theory of Equations in Plain Groups.
IJAC 12(1-2): 1-7 (2002) |
| 2001 |
|---|
| 8 | EE | Markus Lohrey:
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.
MFCS 2001: 500-511 |
| 7 | EE | Markus Lohrey:
On the Parallel Complexity of Tree Automata.
RTA 2001: 201-215 |
| 6 | | Markus Lohrey:
Confluence Problems for Trace Rewriting Systems.
Inf. Comput. 170(1): 1-25 (2001) |
| 2000 |
|---|
| 5 | | Markus Lohrey:
Word Problems and Confluence Problems for Restricted Semi-Thue Systems.
RTA 2000: 172-186 |
| 1999 |
|---|
| 4 | | Markus Lohrey:
Complexity Results for Confluence Problems.
MFCS 1999: 114-124 |
| 1998 |
|---|
| 3 | EE | Holger Hermanns,
Markus Lohrey:
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract).
CONCUR 1998: 237-252 |
| 2 | | Markus Lohrey:
On the Confluence of Trace Rewriting Systems.
FSTTCS 1998: 319-330 |
| 1 | EE | Markus Lohrey:
NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars.
Acta Cybern. 13(3): 209-224 (1998) |
