Thomas Wilke
Thomas Wilke
Professor of Computer Science, Dept. of Computer Science, Kiel University
Verified email at ti.informatik.uni-kiel.de
Title
Cited by
Cited by
Year
Automata, logics, and infinite games: a guide to current research
E Gradel, W Thomas
Springer Science & Business Media, 2002
8572002
Automata, logics, and infinite Games. LNCS, vol. 2500
E Grädel, W Thomas, T Wilke
Springer, Heidelberg, 2002
344*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
230*2002
First-order definable languages.
V Diekert, P Gastin
Logic and automata 2, 261-306, 2008
182*2008
Alternating Tree Automata, Parity Games, and Modal m-Calculus.
T Wilke
Bulletin of the Belgian Mathematical Society Simon Stevin 8 (2), 359, 2001
1792001
Stutter-invariant temporal properties are expressible without the next-time operator
D Peled, T Wilke
Information Processing Letters 63 (5), 243-246, 1997
1731997
Specifying timed state sequences in powerful decidable logics and timed automata
T Wilke
Formal Techniques in Real-Time and Fault-Tolerant Systems, 694-715, 1994
1701994
Classifying discrete temporal properties
T Wilke
Annual symposium on theoretical aspects of computer science, 32-46, 1999
1401999
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
1401998
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
135*2001
CTL+ is exponentially more succinct than CTL
T Wilke
International Conference on Foundations of Software Technology and …, 1999
1161999
An algebraic theory for regular languages of finite and infinite words
T Wilke
International Journal of Algebra and Computation 3 (04), 447-489, 1993
961993
First Fit bin packing: A tight analysis
G Dósa, J Sgall
30th International Symposium on Theoretical Aspects of Computer Science …, 2013
892013
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
892005
An Eilenberg theorem for∞-languages
T Wilke
International Colloquium on Automata, Languages, and Programming, 588-599, 1991
801991
Fair simulation relations, parity games, and state space reduction for Büchi automata
K Etessami, T Wilke, RA Schuller
International Colloquium on Automata, Languages, and Programming, 694-707, 2001
762001
Two hands are better than one (up to constant factors)
S Cannon, ED Demaine, ML Demaine, S Eisenstat, MJ Patitz, ...
arXiv preprint arXiv:1201.1650, 2012
722012
An until hierarchy for temporal logic
K Etessami, T Wilke
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 108-117, 1996
691996
Complementation, disambiguation, and determinization of Büchi automata unified
D Kähler, T Wilke
International Colloquium on Automata, Languages, and Programming, 724-735, 2008
672008
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
591998
The system can't perform the operation now. Try again later.
Articles 1–20