Automata, logics, and infinite games: a guide to current research E Grädel, W Thomas, T Wilke
Springer, 2003
1113 2003 Automata, logics, and infinite Games. LNCS, vol. 2500 E Grädel, W Thomas, T Wilke
Springer, Heidelberg, 2002
550 * 2002 First-order logic with two variables and unary temporal logic K Etessami, MY Vardi, T Wilke
Information and computation 179 (2), 279-295, 2002
266 * 2002 Alternating tree automata, parity games, and modal { T Wilke
Bulletin of the Belgian Mathematical Society-Simon Stevin 8 (2), 359-391, 2001
217 2001 First fit bin packing: A tight analysis G Dósa, J Sgall
30th International symposium on theoretical aspects of computer science …, 2013
205 2013 Stutter-invariant temporal properties are expressible without the next-time operator D Peled, T Wilke
Information Processing Letters 63 (5), 243-246, 1997
204 1997 Specifying timed state sequences in powerful decidable logics and timed automata T Wilke
International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 1994
199 1994 Classifying discrete temporal properties T Wilke
STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science …, 1999
171 1999 Over words, two variables are as powerful as one quantifier alternation D Thérien, T Wilke
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing …, 1998
168 1998 Translating regular expressions into small ε-free nondeterministic finite automata J Hromkovič, S Seibert, T Wilke
Journal of Computer and System Sciences 62 (4), 565-588, 2001
152 * 2001 CTL+ Is Exponentially More Succinct than CTL T Wilke
International Conference on Foundations of Software Technology and …, 1999
135 1999 An algebraic theory for regular languages of finite and infinite words T Wilke
International Journal of Algebra and Computation 3 (04), 447-489, 1993
114 1993 Fair simulation relations, parity games, and state space reduction for Büchi automata K Etessami, T Wilke, RA Schuller
SIAM Journal on Computing 34 (5), 1159-1175, 2005
111 2005 Complementation, disambiguation, and determinization of Büchi automata unified D Kähler, T Wilke
International Colloquium on Automata, Languages, and Programming, 724-735, 2008
94 2008 Automata: from logics to algorithms. MY Vardi, T Wilke
Logic and automata 2, 629-736, 2008
90 2008 Fair simulation relations, parity games, and state space reduction for Büchi automata K Etessami, T Wilke, RA Schuller
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
86 2001 An Eilenberg theorem for∞-languages T Wilke
International Colloquium on Automata, Languages, and Programming, 588-599, 1991
85 1991 An until hierarchy for temporal logic K Etessami, T Wilke
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 108-117, 1996
73 1996 An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages D Peled, T Wilke, P Wolper
Theoretical Computer Science 195 (2), 183-203, 1998
61 1998 An until hierarchy and other applications of an Ehrenfeucht–Fraıssé game for temporal logic K Etessami, T Wilke
Information and Computation 160 (1-2), 88-108, 2000
59 2000 