The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Wilke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ron van der Meyden, Thomas Wilke
    Synthesis of Distributed Systems from Knowledge-Based Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:562-576 [Conf]
  2. Doron Peled, Thomas Wilke, Pierre Wolper
    An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:596-610 [Conf]
  3. Detlef Kähler, Thomas Wilke
    Program Complexity of Dynamic LTL Model Checking. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:271-284 [Conf]
  4. Sebastian Seibert, Thomas Wilke
    Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:179-212 [Conf]
  5. Carsten Fritz, Thomas Wilke
    Simulation Relations for Alternating Parity Automata and Parity Games. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:59-70 [Conf]
  6. Denis Thérien, Thomas Wilke
    Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:256-263 [Conf]
  7. Carsten Fritz, Thomas Wilke
    State Space Reductions for Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:157-168 [Conf]
  8. Ralf Küsters, Thomas Wilke
    Deciding the First Level of the µ-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:241-252 [Conf]
  9. Thomas Wilke
    CTL+ is Exponentially more Succinct than CTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:110-121 [Conf]
  10. Thomas Wilke
    Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1994, pp:694-715 [Conf]
  11. Martin Dickhöfer, Thomas Wilke
    Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:281-290 [Conf]
  12. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
    Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:694-707 [Conf]
  13. Detlef Kähler, Ralf Küsters, Thomas Wilke
    A Dolev-Yao-Based Definition of Abuse-Free Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:95-106 [Conf]
  14. Thomas Wilke
    An Eilenberg Theorem for Infinity-Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:588-599 [Conf]
  15. Thomas Wilke
    Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:347-358 [Conf]
  16. Thomas Wilke
    Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:347-357 [Conf]
  17. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
    First-Order Logic with Two Variables and Unary Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:228-235 [Conf]
  18. Kousha Etessami, Thomas Wilke
    An Until Hierarchy for Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:108-117 [Conf]
  19. Thomas Wilke
    Minimizing Automata on Infinite Words. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:289- [Conf]
  20. Thomas Wilke
    Linear Temporal Logic and Finite Semigroups. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:96-110 [Conf]
  21. Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
    A Characterization of First-Order Topological Properties of Planar Spatial Data. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:107-114 [Conf]
  22. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:55-66 [Conf]
  23. Detlef Kähler, Ralf Küsters, Thomas Wilke
    Deciding Properties of Contract-Signing Protocols. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:158-169 [Conf]
  24. Ralf Küsters, Thomas Wilke
    Automata-Based Analysis of Recursive Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:382-393 [Conf]
  25. Denis Thérien, Thomas Wilke
    Nesting Until and Since in Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:455-464 [Conf]
  26. Thomas Wilke
    Locally Threshold Testable Languages of Infinite Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:607-616 [Conf]
  27. Thomas Wilke
    Classifying Discrete Temporal Properties. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:32-46 [Conf]
  28. Denis Thérien, Thomas Wilke
    Over Words, Two Variables Are as Powerful as One Quantifier Alternation. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:234-240 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:288-302 [Conf]
  30. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
    First-Order Logic with Two Variables and Unary Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:279-295 [Journal]
  31. Kousha Etessami, Thomas Wilke
    An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:160, n:1-2, pp:88-108 [Journal]
  32. Thomas Wilke, Haiseung Yoo
    Computing the Rabin Index of a Regular Language of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:1, pp:61-70 [Journal]
  33. Doron Peled, Thomas Wilke
    Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:243-246 [Journal]
  34. Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
    A characterization of first-order topological properties of planar spatial data. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:2, pp:273-305 [Journal]
  35. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:565-588 [Journal]
  36. Denis Thérien, Thomas Wilke
    Nesting Until and Since in Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:111-131 [Journal]
  37. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
    Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1159-1175 [Journal]
  38. Denis Thérien, Thomas Wilke
    Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:777-798 [Journal]
  39. Carsten Fritz, Thomas Wilke
    Simulation relations for alternating Büchi automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:275-314 [Journal]
  40. Doron Peled, Thomas Wilke, Pierre Wolper
    An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:2, pp:183-203 [Journal]
  41. Thomas Wilke
    An Algebraic Characterization of Frontier Testable Tree Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:1, pp:85-106 [Journal]

  42. A Simulation-Based Treatment of Authenticated Message Exchange. [Citation Graph (, )][DBLP]


  43. Selecting theories and nonce generation for recursive protocols. [Citation Graph (, )][DBLP]


  44. Computationally secure two-round authenticated message exchange. [Citation Graph (, )][DBLP]


  45. Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. [Citation Graph (, )][DBLP]


  46. Complementation, Disambiguation, and Determinization of Büchi Automata Unified. [Citation Graph (, )][DBLP]


  47. Preservation of epistemic properties in security protocol implementations. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002