| Two-variable logic on data trees and XML reasoning M Bojańczyk, A Muscholl, T Schwentick, L Segoufin Journal of the ACM (JACM) 56 (3), 1-48, 2009 | 264 | 2009 |
| Two-variable logic on words with data M Bojanczyk, A Muscholl, T Schwentick, L Segoufin, C David 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 7-16, 2006 | 246 | 2006 |
| Two-variable logic on data words M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011 | 214 | 2011 |
| Deciding properties for message sequence charts A Muscholl, D Peled, Z Su International Conference on Foundations of Software Science and Computation …, 1998 | 160 | 1998 |
| Message sequence graphs and decision problems on Mazurkiewicz traces A Muscholl, D Peled Mathematical Foundations of Computer Science 1999: 24th International …, 1999 | 151 | 1999 |
| Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004 | 115 | 2004 |
| Numerical document queries H Seidl, T Schwentick, A Muscholl Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003 | 99 | 2003 |
| Compositional message sequence charts EL Gunter, A Muscholl, DA Peled International Conference on Tools and Algorithms for the Construction and …, 2001 | 99 | 2001 |
| A Kleene theorem and model checking algorithms for existentially bounded communicating automata B Genest, D Kuske, A Muscholl Information and Computation 204 (6), 920-956, 2006 | 97 | 2006 |
| Computing ϵ-free NFA from regular expressions in O (n log2 (n)) time C Hagenah, A Muscholl RAIRO-Theoretical Informatics and Applications 34 (4), 257-277, 2000 | 77* | 2000 |
| Logical definability on infinite traces W Ebinger, A Muscholl Theoretical Computer Science 154 (1), 67-84, 1996 | 74 | 1996 |
| A lower bound on web services composition A Muscholl, I Walukiewicz International Conference on Foundations of Software Science and …, 2007 | 70 | 2007 |
| On communicating automata with bounded channels B Genest, D Kuske, A Muscholl Fundamenta Informaticae 80 (1-3), 147-167, 2007 | 66 | 2007 |
| Infinite-state high-level MSCs: Model-checking and realizability B Genest, A Muscholl, H Seidl, M Zeitoun Journal of Computer and System Sciences 72 (4), 617-647, 2006 | 62 | 2006 |
| Synthesis of distributed algorithms using asynchronous automata A Ştefănescu, J Esparza, A Muscholl CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 59 | 2003 |
| Bounded MSC communication M Lohrey, A Muscholl Information and Computation 189 (2), 160-181, 2004 | 56 | 2004 |
| Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre International Conference on Foundations of Software Science and …, 2010 | 48 | 2010 |
| Infinite-state high-level MSCs: Model-checking and realizability B Genest, A Muscholl, H Seidl, M Zeitoun Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002 | 48 | 2002 |
| Counting in trees. H Seidl, T Schwentick, A Muscholl Logic and Automata 2, 575-612, 2008 | 47 | 2008 |
| Asynchronous games over tree architectures B Genest, H Gimbert, A Muscholl, I Walukiewicz Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 45 | 2013 |
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
