The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Markus Lohrey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Holger Hermanns, Markus Lohrey
    Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:237-252 [Conf]
  2. Markus Lohrey
    Safe Realizability of High-Level Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:177-192 [Conf]
  3. Stefan Göller, Markus Lohrey
    Infinite State Model-Checking of Propositional Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:349-364 [Conf]
  4. Giorgio Busatto, Markus Lohrey, Sebastian Maneth
    Efficient Memory Representation of XML Documents. [Citation Graph (0, 0)][DBLP]
    DBPL, 2005, pp:199-216 [Conf]
  5. Markus Lohrey
    Decidability and Complexity in Automatic Monoids. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:308-320 [Conf]
  6. Dietrich Kuske, Markus Lohrey
    First-Order and Counting Theories of omega-Automatic Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:322-336 [Conf]
  7. Markus Lohrey, Anca Muscholl
    Bounded MSC Communication. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:295-309 [Conf]
  8. Volker Diekert, Markus Lohrey
    Word Equations over Graph Products. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:156-167 [Conf]
  9. Stefan Göller, Markus Lohrey
    Fixpoint Logics on Hierarchical Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:483-494 [Conf]
  10. Markus Lohrey
    On the Confluence of Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:319-330 [Conf]
  11. Dietrich Kuske, Markus Lohrey
    On the Theory of One-Step Rewriting in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:752-763 [Conf]
  12. Markus Lohrey
    Word Problems on Compressed Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:906-918 [Conf]
  13. Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns
    Axiomatising Divergence. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:585-596 [Conf]
  14. Markus Lohrey, Géraud Sénizergues
    Theories of HNN-Extensions and Amalgamated Products. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:504-515 [Conf]
  15. Dietrich Kuske, Markus Lohrey
    Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:91-100 [Conf]
  16. Markus Lohrey
    Model-Checking Hierarchical Structures. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:168-177 [Conf]
  17. Markus Lohrey
    Automatic Structures of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:346-360 [Conf]
  18. Volker Diekert, Markus Lohrey, Alexander Miller
    Partially Commutative Inverse Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:292-304 [Conf]
  19. Yury Lifshits, Markus Lohrey
    Querying and Embedding Compressed Texts. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:681-692 [Conf]
  20. Markus Lohrey
    Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:500-511 [Conf]
  21. Markus Lohrey
    Complexity Results for Confluence Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:114-124 [Conf]
  22. Markus Lohrey, Nicole Ondrusch
    Inverse Monoids: Decidability and Complexity of Algebraic Questions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:664-675 [Conf]
  23. Markus Lohrey
    Word Problems and Confluence Problems for Restricted Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:172-186 [Conf]
  24. Markus Lohrey
    On the Parallel Complexity of Tree Automata. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:201-215 [Conf]
  25. Volker Diekert, Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:501-512 [Conf]
  26. Dietrich Kuske, Markus Lohrey
    Decidable Theories of Cayley-Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:463-474 [Conf]
  27. Markus Lohrey, Sebastian Maneth
    Tree Automata and XPath on Compressed Trees. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:225-237 [Conf]
  28. Markus Lohrey
    NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1998, v:13, n:3, pp:209-224 [Journal]
  29. Dietrich Kuske, Markus Lohrey
    Logical aspects of Cayley-graphs: the group case. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:131, n:1-3, pp:263-286 [Journal]
  30. Markus Lohrey
    Confluence Problems for Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:170, n:1, pp:1-25 [Journal]
  31. Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns
    Axiomatising divergence. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:2, pp:115-144 [Journal]
  32. Markus Lohrey, Anca Muscholl
    Bounded MSC communication. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:2, pp:160-181 [Journal]
  33. Volker Diekert, Markus Lohrey
    A Note on The Existential Theory of Equations in Plain Groups. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:1-2, pp:1-7 [Journal]
  34. Dietrich Kuske, Markus Lohrey
    Logical Aspects of Cayley-graphs: the Monoid Case. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:2, pp:307-340 [Journal]
  35. Markus Lohrey
    Decidability and complexity in automatic monoids. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:707-722 [Journal]
  36. Volker Diekert, Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:133-156 [Journal]
  37. Dietrich Kuske, Markus Lohrey
    Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:1, pp:39-81 [Journal]
  38. Markus Lohrey
    Word Problems and Membership Problems on Compressed Words. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1210-1240 [Journal]
  39. Markus Lohrey
    Realizability of high-level message sequence charts: closing the gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:309, n:1-3, pp:529-554 [Journal]
  40. Markus Lohrey, Sebastian Maneth
    The complexity of tree automata and XPath on grammar-compressed trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:196-210 [Journal]
  41. Markus Lohrey, Saul Schleimer
    Efficient Computation in Groups Via Compression. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:249-258 [Conf]
  42. Stefan Göller, Markus Lohrey, Carsten Lutz
    PDL with Intersection and Converse Is 2 EXP-Complete. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:198-212 [Conf]
  43. Markus Lohrey, Nicole Ondrusch
    Inverse monoids: Decidability and complexity of algebraic questions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1212-1234 [Journal]

  44. Automatic Structures of Bounded Degree Revisited. [Citation Graph (, )][DBLP]


  45. The Isomorphism Problem for omega-Automatic Trees. [Citation Graph (, )][DBLP]


  46. Compressed Word Problems in HNN-Extensions and Amalgamated Products. [Citation Graph (, )][DBLP]


  47. 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  48. Application of verification techniques to inverse monoids. [Citation Graph (, )][DBLP]


  49. 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  50. PDL with Intersection and Converse is 2EXP-complete. [Citation Graph (, )][DBLP]


  51. Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. [Citation Graph (, )][DBLP]


  52. Parameter Reduction in Grammar-Compressed Trees. [Citation Graph (, )][DBLP]


  53. Leaf languages and string compression. [Citation Graph (, )][DBLP]


  54. Hamiltonicity of automatic graphs. [Citation Graph (, )][DBLP]


  55. The Isomorphism Problem on Classes of Automatic Structures. [Citation Graph (, )][DBLP]


  56. Branching-time Model Checking of One-counter Processes. [Citation Graph (, )][DBLP]


  57. Automatic structures of bounded degree revisited [Citation Graph (, )][DBLP]


  58. Branching-time model checking of one-counter processes [Citation Graph (, )][DBLP]


  59. Branching-time model checking of one-counter processes [Citation Graph (, )][DBLP]


  60. The Isomorphism Problem On Classes of Automatic Structures [Citation Graph (, )][DBLP]


  61. The Isomorphism Problem for omega-Automatic Trees [Citation Graph (, )][DBLP]


  62. Tree structure compression with RePair [Citation Graph (, )][DBLP]


Search in 0.047secs, Finished in 0.049secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002