Thomas Wilke

Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi: Unifying Büchi Complementation Constructions. Logical Methods in Computer Science 9(1) (2013)

Natacha Portier, Thomas Wilke: Frontmatter, Table of Contents, Preface, Workshop Organization. STACS 2013

Natacha Portier, Thomas Wilke: Author Index. STACS 2013: 646-647

Natacha Portier, Thomas Wilke (Eds.): 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. LIPIcs 20, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2013, isbn 978-3-939897-50-7

Sebastian Preugschat, Thomas Wilke: Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata. CoRR abs/1303.5956 (2013)

Sebastian Preugschat, Thomas Wilke: Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. FoSSaCS 2012: 135-149

Christoph Dürr, Thomas Wilke: Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS 2012

Christoph Dürr, Thomas Wilke (Eds.): 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. LIPIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012, isbn 978-3-939897-35-4

Sebastian Eggert, Henning Schnoor, Thomas Wilke: Dynamic Noninterference: Consistent Policies, Characterizations and Verification. CoRR abs/1208.5580 (2012)

Ralf Küsters, Thomas Wilke: Moderne Kryptographie - Eine Einführung. Vieweg + Teubner 2011, isbn 978-3-519-00509-4

Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke: Unifying Büchi Complementation Constructions. CSL 2011: 248-263

Thomas Wilke: A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. Developments in Language Theory 2011: 44-45

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

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: Computationally secure two-round authenticated message exchange. ASIACCS 2010: 214-225

Sebastian Fischer, Frank Huch, Thomas Wilke: A play on regular expressions: functional pearl. ICFP 2010: 357-368

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN 2009: 109-123

Mihhail Aizatulin, Henning Schnoor, Thomas Wilke: Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS 2009: 571-586

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptology ePrint Archive 2009: 262 (2009)

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptology ePrint Archive 2009: 368 (2009)

Moshe Y. Vardi, Thomas Wilke: Automata: from logics to algorithms. Logic and Automata 2008: 629-736

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

Jörg Flum, Erich Grädel, Thomas Wilke (Eds.): Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games 2, Amsterdam University Press 2008, isbn 978-90-5356-576-6

Ralf Küsters, Thomas Wilke: Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12): 1741-1776 (2007)

Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke: Selecting theories and nonce generation for recursive protocols. FMSE 2007: 61-70

Ron van der Meyden, Thomas Wilke: Preservation of epistemic properties in security protocol implementations. TARK 2007: 212-221

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): 273-305 (2006)

Carsten Fritz, Thomas Wilke: Simulation Relations for Alternating Parity Automata and Parity Games. Developments in Language Theory 2006: 59-70

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

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): 1159-1175 (2005)

Carsten Fritz, Thomas Wilke: Simulation relations for alternating Büchi automata. Theor. Comput. Sci. 338(1-3): 275-314 (2005)

Ron van der Meyden, Thomas Wilke: Synthesis of Distributed Systems from Knowledge-Based Specifications. CONCUR 2005: 562-576

Detlef Kähler, Ralf Küsters, Thomas Wilke: Deciding Properties of Contract-Signing Protocols. STACS 2005: 158-169

Denis Thérien, Thomas Wilke: Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. 37(1): 111-131 (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: 107-114

Ralf Küsters, Thomas Wilke: Automata-Based Analysis of Recursive Cryptographic Protocols. STACS 2004: 382-393

Detlef Kähler, Thomas Wilke: Program Complexity of Dynamic LTL Model Checking. CSL 2003: 271-284

Thomas Wilke: Minimizing Automata on Infinite Words. LPAR 2003: 289

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

Carsten Fritz, Thomas Wilke: State Space Reductions for Alternating Büchi Automata. FSTTCS 2002: 157-168

Ralf Küsters, Thomas Wilke: Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS 2002: 241-252

Denis Thérien, Thomas Wilke: Nesting Until and Since in Linear Temporal Logic. STACS 2002: 455-464

Erich Grädel, Wolfgang Thomas, Thomas Wilke (Eds.): Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lecture Notes in Computer Science 2500, Springer 2002, isbn 3-540-00388-6

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

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

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

Thomas Wilke: Linear Temporal Logic and Finite Semigroups. MFCS 2001: 96-110

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

Thomas Wilke: CTL⁺ is Exponentially more Succinct than CTL. FSTTCS 1999: 110-121

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

Thomas Wilke: Classifying Discrete Temporal Properties. STACS 1999: 32-46

Doron 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): 183-203 (1998)

Denis Thérien, Thomas Wilke: Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC 1998: 234-240

Doron Peled, Thomas Wilke: Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. 63(5): 243-246 (1997)

Sebastian Seibert, Thomas Wilke: Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms 1997: 179-212

Thomas Wilke: Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. ICALP 1997: 347-357

Kousha Etessami, Moshe Y. Vardi, Thomas Wilke: First-Order Logic with Two Variables and Unary Temporal Logic. LICS 1997: 228-235

Juraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66

Thomas Wilke, Haiseung Yoo: Computing the Rabin Index of a Regular Language of Infinite Words. Inf. Comput. 130(1): 61-70 (1996)

Thomas Wilke: An Algebraic Characterization of Frontier Testable Tree Languages. Theor. Comput. Sci. 154(1): 85-106 (1996)

Doron Peled, Thomas Wilke, Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996: 596-610

Denis Thérien, Thomas Wilke: Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS 1996: 256-263

Kousha Etessami, Thomas Wilke: An Until Hierarchy for Temporal Logic. LICS 1996: 108-117

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: 288-302

Thomas Wilke: Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. FTRTFT 1994: 694-715

Thomas Wilke: Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. ICALP 1993: 347-358

Thomas Wilke: Locally Threshold Testable Languages of Infinite Words. STACS 1993: 607-616

Thomas Wilke: An Eilenberg Theorem for Infinity-Languages. ICALP 1991: 588-599