The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Thomas Wilke" ( http://dblp.L3S.de/Authors/Thomas_Wilke )

URL (Homepage):  http://www.ti.informatik.uni-kiel.de/ag/team/wilke/  Author page on DBLP  Author page in RDF  Community of Thomas Wilke in ASPL-2

Publication years (Num. hits)
1991-1997 (15) 1998-2002 (15) 2003-2007 (15) 2008-2012 (17)
Publication types (Num. hits)
article(16) book(1) inproceedings(42) proceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords

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