| 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 | 61 | 2016 |
| Decidability, complexity, and expressiveness of first-order logic over the subword ordering S Halfon, P Schnoebelen, G Zetzsche 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 59 | 2017 |
| An approach to computing downward closures G Zetzsche Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 59 | 2015 |
| The complexity of downward closure comparisons G Zetzsche arXiv preprint arXiv:1605.03149, 2016 | 33 | 2016 |
| Rational subsets and submonoids of wreath products M Lohrey, B Steinberg, G Zetzsche Information and Computation 243, 191-204, 2015 | 30 | 2015 |
| Knapsack in graph groups M Lohrey, G Zetzsche Theory of Computing Systems 62 (1), 192-246, 2018 | 29 | 2018 |
| Languages ordered by the subword order D Kuske, G Zetzsche arXiv preprint arXiv:1901.02194, 2019 | 27 | 2019 |
| On erasing productions in random context grammars G Zetzsche Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 27 | 2010 |
| Computing downward closures for stacked counter automata G Zetzsche arXiv preprint arXiv:1409.7922, 2014 | 26 | 2014 |
| Properties of multiset language classes defined by multiset pushdown automata M Kudlek, P Totzke, G Zetzsche Fundamenta Informaticae 93 (1-3), 235-244, 2009 | 25 | 2009 |
| Multiset pushdown automata M Kudlek, P Totzke, G Zetzsche Fundamenta Informaticae 93 (1-3), 221-233, 2009 | 24 | 2009 |
| A Characterization for Decidable Separability by Piecewise Testable Languages G Zetzsche, M Zeitoun, L van Rooijen, W Martens, W Czerwiński Discrete Mathematics & Theoretical Computer Science 19, 2017 | 23* | 2017 |
| Silent transitions in automata with storage G Zetzsche International Colloquium on Automata, Languages, and Programming, 434-445, 2013 | 23 | 2013 |
| Knapsack problems for wreath products M Ganardi, D König, M Lohrey, G Zetzsche arXiv preprint arXiv:1709.09598, 2017 | 21 | 2017 |
| Toward understanding the generative capacity of erasing rules in matrix grammars G Zetzsche International Journal of Foundations of Computer Science 22 (02), 411-426, 2011 | 21* | 2011 |
| The emptiness problem for valence automata over graph monoids G Zetzsche Information and Computation 277, 104583, 2021 | 20* | 2021 |
| Rational subsets of Baumslag-Solitar groups M Cadilhac, D Chistikov, G Zetzsche arXiv preprint arXiv:2006.11898, 2020 | 20 | 2020 |
| Separability by piecewise testable languages and downward closures beyond subwords G Zetzsche Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 19* | 2018 |
| Semilinearity and context-freeness of languages accepted by valence automata P Buckheister, G Zetzsche International Symposium on Mathematical Foundations of Computer Science, 231-242, 2013 | 19 | 2013 |
| Monoids as storage mechanisms G Zetzsche Technische Universität Kaiserslautern, 2016 | 18 | 2016 |
Patrick TotzkeUniversity of LiverpoolVerified email at liverpool.ac.uk
