Automata, logics, and infinite games: a guide to current research E Gradel, W Thomas Springer Science & Business Media, 2002 | 820 | 2002 |

Automata, logics, and infinite Games. LNCS, vol. 2500 E Grädel, W Thomas, T Wilke Springer, Heidelberg, 2002 | 438* | 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 | 242* | 2002 |

First-order definable languages. V Diekert, P Gastin Logic and automata 2, 261-306, 2008 | 214* | 2008 |

Alternating tree automata, parity games, and modal {}-calculus T Wilke Bulletin of the Belgian Mathematical Society-Simon Stevin 8 (2), 359-391, 2001 | 194 | 2001 |

Stutter-invariant temporal properties are expressible without the next-time operator D Peled, T Wilke Information Processing Letters 63 (5), 243-246, 1997 | 188 | 1997 |

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 | 181 | 1994 |

Classifying discrete temporal properties T Wilke Annual symposium on theoretical aspects of computer science, 32-46, 1999 | 148 | 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 | 145 | 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 | 140* | 2001 |

First Fit bin packing: A tight analysis G Dósa, J Sgall 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 122 | 2013 |

CTL+ is exponentially more succinct than CTL T Wilke International Conference on Foundations of Software Technology and …, 1999 | 121 | 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 | 103 | 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 | 93 | 2005 |

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 | 80 | 2001 |

An Eilenberg theorem for∞-languages T Wilke International Colloquium on Automata, Languages, and Programming, 588-599, 1991 | 80 | 1991 |

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 | 78 | 2012 |

Complementation, disambiguation, and determinization of Büchi automata unified D Kähler, T Wilke International Colloquium on Automata, Languages, and Programming, 724-735, 2008 | 76 | 2008 |

An until hierarchy for temporal logic K Etessami, T Wilke Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 108-117, 1996 | 68 | 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 | 60 | 1998 |