An Eilenberg Theorem for Infinity-Languages. - Thomas Wilke (ICALP, 1991)

Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. - Thomas Wilke (ICALP, 1993)

Locally Threshold Testable Languages of Infinite Words. - Thomas Wilke (STACS, 1993)

An Algebraic Theory for Regular Languages of Finite and Infinite Words. - Thomas Wilke (Int. J. Algebra Comput., 1993)

Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. - Thomas Wilke (FTRTFT, 1994)

Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. - Thomas Wilke (1994)

Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time. - Thomas Wilke; Haiseung Yoo (TAPSOFT, 1995)

An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. - Doron A. Peled; Thomas Wilke; Pierre Wolper (CONCUR, 1996)

An Until Hierarchy for Temporal Logic. - Kousha Etessami; Thomas Wilke (LICS, 1996)

Computing the Rabin Index of a Regular Language of Infinite Words. - Thomas Wilke; Haiseung Yoo (Inf. Comput., 1996)

An Algebraic Characterization of Frontier Testable Tree Languages. - Thomas Wilke (Theor. Comput. Sci., 1996)

Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. - Sebastian Seibert; Thomas Wilke (Lectures on Proof Verification and Approximation Algorithms, 1997)

Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. - Thomas Wilke (ICALP, 1997)

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (STACS, 1997)

Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. - Doron A. Peled; Thomas Wilke (Inf. Process. Lett., 1997)

Over Words, Two Variables Are as Powerful as One Quantifier Alternation. - Denis Thérien; Thomas Wilke (STOC, 1998)

An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. - Doron A. Peled; Thomas Wilke; Pierre Wolper (Theor. Comput. Sci., 1998)

CTL+ is Exponentially more Succinct than CTL. - Thomas Wilke (FSTTCS, 1999)

Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. - Martin Dickhöfer; Thomas Wilke (ICALP, 1999)

Classifying Discrete Temporal Properties. - Thomas Wilke (STACS, 1999)

An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. - Kousha Etessami; Thomas Wilke (Inf. Comput., 2000)

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. - Kousha Etessami; Thomas Wilke; Rebecca A. Schuller (ICALP, 2001)

Linear Temporal Logic and Finite Semigroups. - Thomas Wilke (MFCS, 2001)

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (J. Comput. Syst. Sci., 2001)

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. - Denis Thérien; Thomas Wilke (SIAM J. Comput., 2001)

State Space Reductions for Alternating Büchi Automata. - Carsten Fritz; Thomas Wilke (FSTTCS, 2002)

Deciding the First Level of the µ-Calculus Alternation Hierarchy. - Ralf Küsters; Thomas Wilke (FSTTCS, 2002)

First-Order Logic with Two Variables and Unary Temporal Logic. - Kousha Etessami; Moshe Y. Vardi; Thomas Wilke (Inf. Comput., 2002)

Program Complexity of Dynamic LTL Model Checking. - Detlef Kähler; Thomas Wilke (CSL, 2003)

Minimizing Automata on Infinite Words. - Thomas Wilke (LPAR, 2003)

A Characterization of First-Order Topological Properties of Planar Spatial Data. - Michael Benedikt; Christof Löding; Jan Van den Bussche; Thomas Wilke (PODS, 2004)

Automata-Based Analysis of Recursive Cryptographic Protocols. - Ralf Küsters; Thomas Wilke (STACS, 2004)

Nesting Until and Since in Linear Temporal Logic. - Denis Thérien; Thomas Wilke (Theory Comput. Syst., 2004)

Synthesis of Distributed Systems from Knowledge-Based Specifications. - Ron van der Meyden; Thomas Wilke (CONCUR, 2005)

Deciding Properties of Contract-Signing Protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (STACS, 2005)

Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. - Kousha Etessami; Thomas Wilke; Rebecca A. Schuller (SIAM J. Comput., 2005)

Simulation relations for alternating Büchi automata. - Carsten Fritz; Thomas Wilke (Theor. Comput. Sci., 2005)

Simulation Relations for Alternating Parity Automata and Parity Games. - Carsten Fritz; Thomas Wilke (Developments in Language Theory, 2006)

A Dolev-Yao-Based Definition of Abuse-Free Protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (ICALP (2), 2006)

A characterization of first-order topological properties of planar spatial data. - Michael Benedikt; Bart Kuijpers; Christof Löding; Jan Van den Bussche; Thomas Wilke (J. ACM, 2006)

Selecting theories and nonce generation for recursive protocols. - Klaas Ole Kürtz; Ralf Küsters; Thomas Wilke (FMSE, 2007)

Preservation of epistemic properties in security protocol implementations. - Ron van der Meyden; Thomas Wilke (TARK, 2007)

Transducer-based analysis of cryptographic protocols. - Ralf Küsters; Thomas Wilke (Inf. Comput., 2007)

Automata: from logics to algorithms. - Moshe Y. Vardi; Thomas Wilke (Logic and Automata, 2008)

Complementation, Disambiguation, and Determinization of Büchi Automata Unified. - Detlef Kähler; Thomas Wilke (ICALP (1), 2008)

Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. - Mihhail Aizatulin; Henning Schnoor; Thomas Wilke (ESORICS, 2009)

Computationally Secure Two-Round Authenticated Message Exchange. - Klaas Ole Kürtz; Henning Schnoor; Thomas Wilke (IACR Cryptol. ePrint Arch., 2009)

A Simulation-Based Treatment of Authenticated Message Exchange. - Klaas Ole Kürtz; Henning Schnoor; Thomas Wilke (IACR Cryptol. ePrint Arch., 2009)

A play on regular expressions: functional pearl. - Sebastian Fischer 001; Frank Huch; Thomas Wilke (ICFP, 2010)

Deciding strategy properties of contract-signing protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (ACM Trans. Comput. Log., 2010)

Moderne Kryptographie - Eine Einführung. - Ralf Küsters; Thomas Wilke (Vieweg + Teubner, 2011)

A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. - Thomas Wilke (Developments in Language Theory, 2011)

The Complexity of Intransitive Noninterference. - Sebastian Eggert; Ron van der Meyden; Henning Schnoor; Thomas Wilke (IEEE Symposium on Security and Privacy, 2011)

Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. - Sebastian Preugschat; Thomas Wilke (FoSSaCS, 2012)

Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. - Christoph Dürr; Thomas Wilke (STACS, 2012)

Dynamic Noninterference: Consistent Policies, Characterizations and Verification - Sebastian Eggert; Henning Schnoor; Thomas Wilke (CoRR, 2012)

Noninterference with Local Policies. - Sebastian Eggert; Henning Schnoor; Thomas Wilke (MFCS, 2013)

Frontmatter, Table of Contents, Preface, Workshop Organization. - Natacha Portier; Thomas Wilke (STACS, 2013)

Author Index. - Natacha Portier; Thomas Wilke (STACS, 2013)

Complexity and Unwinding for Intransitive Noninterference. - Sebastian Eggert; Ron van der Meyden; Henning Schnoor; Thomas Wilke (CoRR, 2013)

Profile Trees for Büchi Word Automata, with Application to Determinization. - Seth Fogarty; Orna Kupferman; Moshe Y. Vardi; Thomas Wilke (GandALF, 2013)

Unifying Büchi Complementation Constructions - Seth Fogarty; Orna Kupferman; Thomas Wilke; Moshe Y. Vardi (Log. Methods Comput. Sci., 2013)

Effective Characterizations of Simple Fragments of Temporal Logic Using Carton–Michel Automata - Sebastian Preugschat; Thomas Wilke (Log. Methods Comput. Sci., 2013)

Veranstaltungskalender. - Bernhard Koerber; Thomas Wilke (LOG IN, 2013)

Preface of STACS 2012 Special Issue. - Christoph Dürr; Thomas Wilke (Theory Comput. Syst., 2014)

Past, Present, and Infinite Future. - Thomas Wilke (ICALP, 2016)

ω-Automata. - Thomas Wilke (CoRR, 2016)

Backward Deterministic Büchi Automata on Infinite Words. - Thomas Wilke (FSTTCS, 2017)

Backward deterministic and weak alternating ω-automata. - Sebastian Preugschat; Thomas Wilke (CoRR, 2017)

Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods. - Pamela Fleischmann; Mitja Kulczynski; Dirk Nowotka; Thomas Wilke (FMTea, 2019)

Visually Representing History Dependencies in Event Logs. - Manuel Wetzel; Agnes Koschmider; Thomas Wilke (ICPM Workshops, 2020)

ω-Automata. - Thomas Wilke; Sven Schewe (Handbook of Automata Theory (I.), 2021)

Classification of freshwater snails of the genus Radomaniola with multimodal triplet networks. - Dennis Vetter; Muhammad Ahsan; Diana Delicado; Thomas A. Neubauer; Thomas Wilke; Gemma Roig (CoRR, 2024)