dblp.uni-trier.dewww.uni-trier.de

Markus Lohrey Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Giorgio Busatto [30] [48]
2Pedro R. D'Argenio [12] [25]
3Volker Diekert [9] [10] [18] [19] [36] [49] [50]
4Rodney G. Downey (Rod Downey) [46] [47] [55]
5Stefan Göller [29] [40] [42] [44] [56]
6Niko Haubold [58]
7Holger Hermanns [3] [12] [25]
8Bakhadyr Khoussainov [46] [47] [55]
9Dietrich Kuske [11] [16] [23] [26] [34] [37] [39] [46] [47] [52] [53] [55] [59]
10Yury Lifshits [35]
11Carsten Lutz [42] [44]
12Sebastian Maneth [30] [31] [32] [48] [57]
13Alexander Miller [36]
14Anca Muscholl [13] [20]
15Nicole Ondrusch [27] [41] [50]
16Saul Schleimer [43]
17Manfred Schmidt-Schauß [57]
18Géraud Sénizergues [38] [51]
19Moshe Y. Vardi [46] [47] [55]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)