| Algorithmics on SLP-compressed strings: A survey M Lohrey Groups-Complexity-Cryptology 4 (2), 241-299, 2012 | 160 | 2012 |
| Efficient memory representation of XML document trees G Busatto, M Lohrey, S Maneth Information Systems 33 (4-5), 456-474, 2008 | 99 | 2008 |
| XML tree structure compression using RePair M Lohrey, S Maneth, R Mennicke Information Systems 38 (8), 1150-1167, 2013 | 92 | 2013 |
| Efficient memory representation of XML documents G Busatto, M Lohrey, S Maneth International Workshop on Database Programming Languages, 199-216, 2005 | 77 | 2005 |
| Word problems and membership problems on compressed words M Lohrey SIAM Journal on Computing 35 (5), 1210-1240, 2006 | 67 | 2006 |
| Logical aspects of Cayley-graphs: the group case D Kuske, M Lohrey Annals of Pure and Applied Logic 131 (1-3), 263-286, 2005 | 64 | 2005 |
| The compressed word problem for groups M Lohrey Springer, 2014 | 62 | 2014 |
| The isomorphism problem on classes of automatic structures with transitive relations D Kuske, J Liu, M Lohrey Transactions of the American Mathematical Society 365 (10), 5103-5151, 2013 | 61 | 2013 |
| The complexity of tree automata and XPath on grammar-compressed trees M Lohrey, S Maneth Theoretical Computer Science 363 (2), 196-210, 2006 | 60 | 2006 |
| Balancing straight-line programs M Ganardi, A Jeż, M Lohrey Journal of the ACM (JACM) 68 (4), 1-40, 2021 | 56 | 2021 |
| Bounded MSC communication M Lohrey, A Muscholl Information and Computation 189 (2), 160-181, 2004 | 55 | 2004 |
| Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups D König, M Lohrey, G Zetzsche Algebra and Computer Science 677, 138-153, 2016 | 52 | 2016 |
| The submonoid and rational subset membership problems for graph groups M Lohrey, B Steinberg Journal of Algebra 320 (2), 728-755, 2008 | 50 | 2008 |
| The rational subset membership problem for groups: a survey M Lohrey Groups St Andrews 422, 368-389, 2013 | 47 | 2013 |
| XML compression via directed acyclic graphs M Bousquet-Mélou, M Lohrey, S Maneth, E Noeth Theory of Computing Systems 57, 1322-1371, 2015 | 45 | 2015 |
| Querying and embedding compressed texts Y Lifshits, M Lohrey International Symposium on Mathematical Foundations of Computer Science, 681-692, 2006 | 45 | 2006 |
| Safe Realizability of High-Level Message Sequence Charts* M Lohrey CONCUR 2002—Concurrency Theory: 13th International Conference Brno, Czech …, 2002 | 42 | 2002 |
| On the parallel complexity of tree automata M Lohrey International Conference on Rewriting Techniques and Applications, 201-215, 2001 | 42 | 2001 |
| Parameter reduction and automata evaluation for grammar-compressed trees M Lohrey, S Maneth, M Schmidt-Schauß Journal of Computer and System Sciences 78 (5), 1651-1669, 2012 | 41 | 2012 |
| Efficient computation in groups via compression M Lohrey, S Schleimer International Computer Science Symposium in Russia, 249-258, 2007 | 39 | 2007 |
