| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christoph Dürr, Thomas Wilke (eds.) |
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France  |
STACS  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Christoph Dürr, Thomas Wilke |
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents.  |
STACS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Preugschat, Thomas Wilke |
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Küsters, Thomas Wilke |
Moderne Kryptographie - Eine Einführung.  |
|
2011 |
RDF |
|
| 1 | Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke |
The Complexity of Intransitive Noninterference.  |
IEEE Symposium on Security and Privacy  |
2011 |
DBLP DOI BibTeX RDF |
verification, information flow, noninterference |
| 1 | Thomas Wilke |
A Functional Program for Regular Expressions Matching - Abstract of Invited Talk.  |
Developments in Language Theory  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke |
Unifying Büchi Complementation Constructions.  |
CSL  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Ralf Küsters, Thomas Wilke |
Deciding strategy properties of contract-signing protocols.  |
ACM Trans. Comput. Log.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Fischer, Frank Huch, Thomas Wilke |
A play on regular expressions: functional pearl.  |
ICFP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
Computationally secure two-round authenticated message exchange.  |
ASIACCS  |
2010 |
DBLP DOI BibTeX RDF |
authenticated message exchange, cryptographic protocols, timestamps |
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
A Simulation-Based Treatment of Authenticated Message Exchange.  |
IACR Cryptology ePrint Archive  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
Computationally Secure Two-Round Authenticated Message Exchange.  |
IACR Cryptology ePrint Archive  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
A Simulation-Based Treatment of Authenticated Message Exchange.  |
ASIAN  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihhail Aizatulin, Henning Schnoor, Thomas Wilke |
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol.  |
ESORICS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Thomas Wilke |
Complementation, Disambiguation, and Determinization of Büchi Automata Unified.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Y. Vardi, Thomas Wilke |
Automata: from logics to algorithms.  |
Logic and Automata ![In: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., pp. 629-736, 2008, Amsterdam University Press, 978-90-5356-576-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jörg Flum, Erich Grädel, Thomas Wilke (eds.) |
Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas].  |
Logic and Automata  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ralf Küsters, Thomas Wilke |
Transducer-based analysis of cryptographic protocols.  |
Inf. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron van der Meyden, Thomas Wilke |
Preservation of epistemic properties in security protocol implementations.  |
TARK  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke |
Selecting theories and nonce generation for recursive protocols.  |
FMSE  |
2007 |
DBLP DOI BibTeX RDF |
security protocols, decidability, automatic analysis |
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Ralf Küsters, Thomas Wilke |
A Dolev-Yao-Based Definition of Abuse-Free Protocols.  |
ICALP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Fritz, Thomas Wilke |
Simulation Relations for Alternating Parity Automata and Parity Games.  |
Developments in Language Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Fritz, Thomas Wilke |
Simulation relations for alternating Büchi automata.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Thomas Wilke, Rebecca A. Schuller |
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata.  |
SIAM J. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron van der Meyden, Thomas Wilke |
Synthesis of Distributed Systems from Knowledge-Based Specifications.  |
CONCUR  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Ralf Küsters, Thomas Wilke |
Deciding Properties of Contract-Signing Protocols.  |
STACS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Nesting Until and Since in Linear Temporal Logic.  |
Theory Comput. Syst.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Küsters, Thomas Wilke |
Automata-Based Analysis of Recursive Cryptographic Protocols.  |
STACS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke |
A Characterization of First-Order Topological Properties of Planar Spatial Data. (PDF / PS)  |
PODS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Minimizing Automata on Infinite Words.  |
LPAR  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Thomas Wilke |
Program Complexity of Dynamic LTL Model Checking.  |
CSL  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
First-Order Logic with Two Variables and Unary Temporal Logic.  |
Inf. Comput.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Nesting Until and Since in Linear Temporal Logic.  |
STACS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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]  |
Automata, Logics, and Infinite Games  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ralf Küsters, Thomas Wilke |
Deciding the First Level of the µ-Calculus Alternation Hierarchy.  |
FSTTCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Fritz, Thomas Wilke |
State Space Reductions for Alternating Büchi Automata.  |
FSTTCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.  |
J. Comput. Syst. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.  |
SIAM J. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Thomas Wilke, Rebecca A. Schuller |
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.  |
ICALP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Linear Temporal Logic and Finite Semigroups.  |
MFCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Thomas Wilke |
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic.  |
Inf. Comput.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dickhöfer, Thomas Wilke |
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem.  |
ICALP  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Classifying Discrete Temporal Properties.  |
STACS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
CTL+ is Exponentially more Succinct than CTL.  |
FSTTCS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Doron Peled, Thomas Wilke, Pierre Wolper |
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages.  |
Theor. Comput. Sci.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Over Words, Two Variables Are as Powerful as One Quantifier Alternation.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Doron Peled, Thomas Wilke |
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator.  |
Inf. Process. Lett.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic.  |
ICALP  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.  |
STACS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Seibert, Thomas Wilke |
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT.  |
Lectures on Proof Verification and Approximation Algorithms  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
First-Order Logic with Two Variables and Unary Temporal Logic.  |
LICS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
An Algebraic Characterization of Frontier Testable Tree Languages.  |
Theor. Comput. Sci.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke, Haiseung Yoo |
Computing the Rabin Index of a Regular Language of Infinite Words.  |
Inf. Comput.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Doron Peled, Thomas Wilke, Pierre Wolper |
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.  |
CONCUR  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Thomas Wilke |
An Until Hierarchy for Temporal Logic.  |
LICS  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.  |
FOCS  |
1996 |
DBLP DOI BibTeX RDF |
semidirect products, until hierarchy, finite semigroups, algebraic characterization, nesting depth, finite semigroup theory, temporal logic, temporal logic |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata.  |
FTRTFT  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability.  |
ICALP  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
Locally Threshold Testable Languages of Infinite Words.  |
STACS  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Wilke |
An Eilenberg Theorem for Infinity-Languages.  |
ICALP  |
1991 |
DBLP DOI BibTeX RDF |
|