Thomas Wilke

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 7

Top Venues

CoRR

FMTea

Theory Comput. Syst.

ICALP

University of Kiel, Germany (PHD)

Education History

University of Kiel, Germany

PHD

Publications

Dennis Vetter, Muhammad Ahsan, Diana Delicado, Thomas A. Neubauer, Thomas Wilke, Gemma Roig
Classification of freshwater snails of the genus Radomaniola with multimodal triplet networks. CoRR (2024)
Manuel Wetzel, Agnes Koschmider, Thomas Wilke
Visually Representing History Dependencies in Event Logs. ICPM Workshops (2020)
Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Thomas Wilke
Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods. FMTea (2019)
Thomas Wilke
Backward Deterministic Büchi Automata on Infinite Words. FSTTCS (2017)
Sebastian Preugschat, Thomas Wilke
Backward deterministic and weak alternating ω-automata. CoRR (2017)
Thomas Wilke
Past, Present, and Infinite Future. ICALP (2016)
Thomas Wilke
ω-Automata. CoRR (2016)
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
Profile trees for Büchi word automata, with application to determinization. Inf. Comput. 245 (2015)
Christoph Dürr, Thomas Wilke
Preface of STACS 2012 Special Issue. Theory Comput. Syst. 55 (4) (2014)
Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi
Unifying Büchi Complementation Constructions Log. Methods Comput. Sci. 9 (1) (2013)
Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
Complexity and Unwinding for Intransitive Noninterference. CoRR (2013)
Bernhard Koerber, Thomas Wilke
Veranstaltungskalender. LOG IN 33 (1) (2013)
Natacha Portier, Thomas Wilke
Author Index. STACS (2013)
Natacha Portier, Thomas Wilke
Frontmatter, Table of Contents, Preface, Workshop Organization. STACS (2013)
Sebastian Preugschat, Thomas Wilke
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata Log. Methods Comput. Sci. 9 (2) (2013)
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
Profile Trees for Büchi Word Automata, with Application to Determinization. GandALF (2013)
Sebastian Eggert, Henning Schnoor, Thomas Wilke
Noninterference with Local Policies. MFCS (2013)
Christoph Dürr, Thomas Wilke
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS (2012)
Sebastian Eggert, Henning Schnoor, Thomas Wilke
Dynamic Noninterference: Consistent Policies, Characterizations and Verification CoRR (2012)
Sebastian Preugschat, Thomas Wilke
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. FoSSaCS (2012)
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
Unifying Büchi Complementation Constructions. CSL (2011)
Thomas Wilke
A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. Developments in Language Theory (2011)
Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy (2011)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
Computationally secure two-round authenticated message exchange. AsiaCCS (2010)
Sebastian Fischer, Frank Huch, Thomas Wilke
A play on regular expressions: functional pearl. ICFP (2010)
Detlef Kähler, Ralf Küsters, Thomas Wilke
Deciding strategy properties of contract-signing protocols. ACM Trans. Comput. Log. 11 (3) (2010)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009 (2009)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009 (2009)
Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS (2009)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN (2009)
Moshe Y. Vardi, Thomas Wilke
Automata: from logics to algorithms. Logic and Automata (2008)
Detlef Kähler, Thomas Wilke
Complementation, Disambiguation, and Determinization of Büchi Automata Unified. ICALP (1) (2008)
Ron van der Meyden, Thomas Wilke
Preservation of epistemic properties in security protocol implementations. TARK (2007)
Ralf Küsters, Thomas Wilke
Transducer-based analysis of cryptographic protocols. Inf. Comput. 205 (12) (2007)
Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke
Selecting theories and nonce generation for recursive protocols. FMSE (2007)
Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
A characterization of first-order topological properties of planar spatial data. J. ACM 53 (2) (2006)
Carsten Fritz, Thomas Wilke
Simulation Relations for Alternating Parity Automata and Parity Games. Developments in Language Theory (2006)
Detlef Kähler, Ralf Küsters, Thomas Wilke
A Dolev-Yao-Based Definition of Abuse-Free Protocols. ICALP (2) (2006)
Ron van der Meyden, Thomas Wilke
Synthesis of Distributed Systems from Knowledge-Based Specifications. CONCUR (2005)
Detlef Kähler, Ralf Küsters, Thomas Wilke
Deciding Properties of Contract-Signing Protocols. STACS (2005)
Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. SIAM J. Comput. 34 (5) (2005)
Carsten Fritz, Thomas Wilke
Simulation relations for alternating Büchi automata. Theor. Comput. Sci. 338 (1-3) (2005)
Ralf Küsters, Thomas Wilke
Automata-Based Analysis of Recursive Cryptographic Protocols. STACS (2004)
Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS (2004)
Denis Thérien, Thomas Wilke
Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. 37 (1) (2004)
Thomas Wilke
Minimizing Automata on Infinite Words. LPAR (2003)
Detlef Kähler, Thomas Wilke
Program Complexity of Dynamic LTL Model Checking. CSL (2003)
Denis Thérien, Thomas Wilke
Nesting Until and Since in Linear Temporal Logic. STACS (2002)
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179 (2) (2002)
Carsten Fritz, Thomas Wilke
State Space Reductions for Alternating Büchi Automata. FSTTCS (2002)
Ralf Küsters, Thomas Wilke
Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS (2002)
Thomas Wilke
Linear Temporal Logic and Finite Semigroups. MFCS (2001)
Denis Thérien, Thomas Wilke
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. SIAM J. Comput. 31 (3) (2001)
Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP (2001)
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62 (4) (2001)
Kousha Etessami, Thomas Wilke
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Inf. Comput. 160 (1-2) (2000)
Martin Dickhöfer, Thomas Wilke
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. ICALP (1999)
Thomas Wilke
Classifying Discrete Temporal Properties. STACS (1999)
Thomas Wilke
is Exponentially more Succinct than CTL. FSTTCS (1999)
Denis Thérien, Thomas Wilke
Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC (1998)
Doron A. Peled, Thomas Wilke, Pierre Wolper
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. Theor. Comput. Sci. 195 (2) (1998)
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS (1997)
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
First-Order Logic with Two Variables and Unary Temporal Logic. LICS (1997)
Thomas Wilke
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. ICALP (1997)
Sebastian Seibert, Thomas Wilke
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms (1997)
Doron A. Peled, Thomas Wilke
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. 63 (5) (1997)
Doron A. Peled, Thomas Wilke, Pierre Wolper
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR (1996)
Denis Thérien, Thomas Wilke
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS (1996)
Kousha Etessami, Thomas Wilke
An Until Hierarchy for Temporal Logic. LICS (1996)
Thomas Wilke
An Algebraic Characterization of Frontier Testable Tree Languages. Theor. Comput. Sci. 154 (1) (1996)
Thomas Wilke, Haiseung Yoo
Computing the Rabin Index of a Regular Language of Infinite Words. Inf. Comput. 130 (1) (1996)
Thomas Wilke, Haiseung Yoo
Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time. TAPSOFT (1995)
Thomas Wilke
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. FTRTFT (1994)
Thomas Wilke
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. ICALP (1993)
Thomas Wilke
Locally Threshold Testable Languages of Infinite Words. STACS (1993)
Thomas Wilke
An Algebraic Theory for Regular Languages of Finite and Infinite Words. Int. J. Algebra Comput. 3 (4) (1993)
Thomas Wilke
An Eilenberg Theorem for Infinity-Languages. ICALP (1991)

Thomas Wilke.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Wilke