| 2020 | ICPM | Visually Representing History Dependencies in Event Logs. | Manuel Wetzel, Agnes Koschmider, Thomas Wilke |
| 2016 | ICALP | Past, Present, and Infinite Future. | Thomas Wilke |
| 2013 | MFCS | Noninterference with Local Policies. | Sebastian Eggert, Henning Schnoor, Thomas Wilke |
| 2013 | STACS | Frontmatter, Table of Contents, Preface, Workshop Organization. | Natacha Portier, Thomas Wilke |
| 2013 | STACS | Author Index. | Natacha Portier, Thomas Wilke |
| 2012 | FOSSACS | Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. | Sebastian Preugschat, Thomas Wilke |
| 2012 | STACS | Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. | Christoph Drr, Thomas Wilke |
| 2011 | CSL | Unifying Bchi Complementation Constructions. | Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke |
| 2011 | DLT | A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. | Thomas Wilke |
| 2011 | SP | The Complexity of Intransitive Noninterference. | Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke |
| 2010 | CCS | Computationally secure two-round authenticated message exchange. | Klaas Ole Krtz, Henning Schnoor, Thomas Wilke |
| 2010 | ICFP | A play on regular expressions: functional pearl. | Sebastian Fischer, Frank Huch, Thomas Wilke |
| 2009 | ESORICS | Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. | Mihhail Aizatulin, Henning Schnoor, Thomas Wilke |
| 2008 | ICALP | Complementation, Disambiguation, and Determinization of Bchi Automata Unified. | Detlef Khler, Thomas Wilke |
| 2007 | CCS | Selecting theories and nonce generation for recursive protocols. | Klaas Ole Krtz, Ralf Ksters, Thomas Wilke |
| 2007 | TARK | Preservation of epistemic properties in security protocol implementations. | Ron van der Meyden, Thomas Wilke |
| 2006 | DLT | Simulation Relations for Alternating Parity Automata and Parity Games. | Carsten Fritz, Thomas Wilke |
| 2006 | ICALP | A Dolev-Yao-Based Definition of Abuse-Free Protocols. | Detlef Khler, Ralf Ksters, Thomas Wilke |
| 2005 | CONCUR | Synthesis of Distributed Systems from Knowledge-Based Specifications. | Ron van der Meyden, Thomas Wilke |
| 2005 | STACS | Deciding Properties of Contract-Signing Protocols. | Detlef Khler, Ralf Ksters, Thomas Wilke |
| 2004 | PODS | A Characterization of First-Order Topological Properties of Planar Spatial Data. | Michael Benedikt, Christof Lding, Jan Van den Bussche, Thomas Wilke |
| 2004 | STACS | Automata-Based Analysis of Recursive Cryptographic Protocols. | Ralf Ksters, Thomas Wilke |
| 2003 | CSL | Program Complexity of Dynamic LTL Model Checking. | Detlef Khler, Thomas Wilke |
| 2003 | LPAR | Minimizing Automata on Infinite Words. | Thomas Wilke |
| 2002 | STACS | Nesting Until and Since in Linear Temporal Logic. | Denis Thrien, Thomas Wilke |
| 2001 | ICALP | Fair Simulation Relations, Parity Games, and State Space Reduction for Bchi Automata. | Kousha Etessami, Thomas Wilke, Rebecca A. Schuller |
| 2001 | MFCS | Linear Temporal Logic and Finite Semigroups. | Thomas Wilke |
| 1999 | ICALP | Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. | Martin Dickhfer, Thomas Wilke |
| 1999 | STACS | Classifying Discrete Temporal Properties. | Thomas Wilke |
| 1998 | STOC | Over Words, Two Variables Are as Powerful as One Quantifier Alternation. | Denis Thrien, Thomas Wilke |
| 1997 | ICALP | Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. | Thomas Wilke |
| 1997 | LICS | First-Order Logic with Two Variables and Unary Temporal Logic. | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
| 1997 | STACS | Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. | Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
| 1996 | CONCUR | An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. | Doron A. Peled, Thomas Wilke, Pierre Wolper |
| 1996 | FOCS | Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. | Denis Thrien, Thomas Wilke |
| 1996 | LICS | An Until Hierarchy for Temporal Logic. | Kousha Etessami, Thomas Wilke |
| 1993 | ICALP | Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. | Thomas Wilke |
| 1993 | STACS | Locally Threshold Testable Languages of Infinite Words. | Thomas Wilke |
| 1991 | ICALP | An Eilenberg Theorem for Infinity-Languages. | Thomas Wilke |