| 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 | 262 | 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 | 235 | 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 | 195 | 2011 |
| Deciding properties for message sequence charts A Muscholl, D Peled, Z Su International Conference on Foundations of Software Science and Computation …, 1998 | 153 | 1998 |
| Message sequence graphs and decision problems on Mazurkiewicz traces A Muscholl, D Peled International Symposium on Mathematical Foundations of Computer Science, 81-91, 1999 | 148 | 1999 |
| Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004 | 113 | 2004 |
| 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 | 99 | 2006 |
| Numerical document queries H Seidl, T Schwentick, A Muscholl Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003 | 98 | 2003 |
| Compositional message sequence charts EL Gunter, A Muscholl, DA Peled International Conference on Tools and Algorithms for the Construction and …, 2001 | 94 | 2001 |
| 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 | 75* | 2000 |
| Logical definability on infinite traces W Ebinger, A Muscholl Theoretical Computer Science 154 (1), 67-84, 1996 | 73 | 1996 |
| A lower bound on web services composition A Muscholl, I Walukiewicz International Conference on Foundations of Software Science and …, 2007 | 68 | 2007 |
| Synthesis of distributed algorithms using asynchronous automata A Ştefănescu, J Esparza, A Muscholl International Conference on Concurrency Theory, 27-41, 2003 | 58 | 2003 |
| 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 | 57 | 2006 |
| On communicating automata with bounded channels B Genest, D Kuske, A Muscholl Fundamenta Informaticae 80 (1-3), 147-167, 2007 | 54 | 2007 |
| Bounded MSC communication M Lohrey, A Muscholl Information and Computation 189 (2), 160-181, 2004 | 51 | 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 | 44 | 2010 |
| Infinite-state high-level MSCs: Model-checking and realizability B Genest, A Muscholl, H Seidl, M Zeitoun International Colloquium on Automata, Languages, and Programming, 657-668, 2002 | 43 | 2002 |
| Logical definability on infinite traces W Ebinger, A Muscholl International Colloquium on Automata, Languages, and Programming, 335-346, 1993 | 43 | 1993 |
| Asynchronous games over tree architectures B Genest, H Gimbert, A Muscholl, I Walukiewicz International Colloquium on Automata, Languages, and Programming, 275-286, 2013 | 42 | 2013 |
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityBestätigte E-Mail-Adresse bei udo.edu
