default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Wilke
Person information
- affiliation: University of Kiel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]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 abs/2407.20013 (2024)- 2021
- [p1]Thomas Wilke, Sven Schewe
:
ω-Automata. Handbook of Automata Theory (I.) 2021: 189-234 - 2020
- [c50]Manuel Wetzel, Agnes Koschmider, Thomas Wilke:
Visually Representing History Dependencies in Event Logs. ICPM Workshops 2020: 5-16
2010 – 2019
- 2019
- [c49]Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Thomas Wilke:
Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods. FMTea 2019: 181-195 - 2017
- [c48]Thomas Wilke:
Backward Deterministic Büchi Automata on Infinite Words. FSTTCS 2017: 6:6-6:9 - [i6]Sebastian Preugschat, Thomas Wilke:
Backward deterministic and weak alternating ω-automata. CoRR abs/1701.01971 (2017) - 2016
- [c47]Thomas Wilke:
Past, Present, and Infinite Future. ICALP 2016: 95:1-95:14 - [i5]Thomas Wilke:
ω-Automata. CoRR abs/1609.03062 (2016) - 2015
- [j20]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Profile trees for Büchi word automata, with application to determinization. Inf. Comput. 245: 136-151 (2015) - [e6]Michael Fothe, Thomas Wilke:
Keller, Stack und automatisches Gedächtnis - eine Struktur mit Potenzial, Tagungsband zum Kolloquium, 14. November 2014 in Jena, Deutschland. LNI T-7, GI 2015, ISBN 978-3-88579-426-4 [contents] - 2014
- [j19]Christoph Dürr, Thomas Wilke:
Preface of STACS 2012 Special Issue. Theory Comput. Syst. 55(4): 637-639 (2014) - 2013
- [j18]Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi:
Unifying Büchi Complementation Constructions. Log. Methods Comput. Sci. 9(1) (2013) - [j17]Sebastian Preugschat, Thomas Wilke:
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata. Log. Methods Comput. Sci. 9(2) (2013) - [j16]Bernhard Koerber, Thomas Wilke:
Veranstaltungskalender. LOG IN 33(1): 75 (2013) - [c46]Sebastian Eggert, Henning Schnoor, Thomas Wilke:
Noninterference with Local Policies. MFCS 2013: 337-348 - [c45]Natacha Portier, Thomas Wilke:
Frontmatter, Table of Contents, Preface, Workshop Organization. STACS 2013 - [c44]Natacha Portier, Thomas Wilke:
Author Index. STACS 2013: 646-647 - [c43]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Profile Trees for Büchi Word Automata, with Application to Determinization. GandALF 2013: 107-121 - [e5]Norbert Breier, Peer Stechert, Thomas Wilke:
Informatik erweitert Horizonte, INFOS 2013, 15. GI-Fachtagung Informatik und Schule, 26.-28. September 2013, Kiel, Germany. LNI P-219, GI 2013, ISBN 978-3-88579-613-8 [contents] - [e4]Natacha Portier, Thomas Wilke:
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. LIPIcs 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-50-7 [contents] - [i4]Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke:
Complexity and Unwinding for Intransitive Noninterference. CoRR abs/1308.1204 (2013) - 2012
- [c42]Sebastian Preugschat, Thomas Wilke:
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. FoSSaCS 2012: 135-149 - [c41]Christoph Dürr, Thomas Wilke:
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS 2012 - [e3]Christoph Dürr, Thomas Wilke:
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. LIPIcs 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-35-4 [contents] - [i3]Sebastian Eggert, Henning Schnoor, Thomas Wilke:
Dynamic Noninterference: Consistent Policies, Characterizations and Verification. CoRR abs/1208.5580 (2012) - 2011
- [b2]Ralf Küsters, Thomas Wilke:
Moderne Kryptographie - Eine Einführung. Vieweg + Teubner 2011, ISBN 978-3-519-00509-4 - [c40]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Unifying Büchi Complementation Constructions. CSL 2011: 248-263 - [c39]Thomas Wilke:
A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. Developments in Language Theory 2011: 44-45 - [c38]Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke:
The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy 2011: 196-211 - 2010
- [j15]Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding strategy properties of contract-signing protocols. ACM Trans. Comput. Log. 11(3): 17:1-17:42 (2010) - [c37]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
Computationally secure two-round authenticated message exchange. AsiaCCS 2010: 214-225 - [c36]Sebastian Fischer, Frank Huch, Thomas Wilke:
A play on regular expressions: functional pearl. ICFP 2010: 357-368
2000 – 2009
- 2009
- [c35]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN 2009: 109-123 - [c34]Mihhail Aizatulin, Henning Schnoor, Thomas Wilke:
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS 2009: 571-586 - [i2]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009: 262 (2009) - [i1]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009: 368 (2009) - 2008
- [c33]Moshe Y. Vardi, Thomas Wilke:
Automata: from logics to algorithms. Logic and Automata 2008: 629-736 - [c32]Detlef Kähler, Thomas Wilke:
Complementation, Disambiguation, and Determinization of Büchi Automata Unified. ICALP (1) 2008: 724-735 - [e2]Jörg Flum, Erich Grädel, Thomas Wilke:
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 [contents] - 2007
- [j14]Ralf Küsters, Thomas Wilke:
Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12): 1741-1776 (2007) - [c31]Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke:
Selecting theories and nonce generation for recursive protocols. FMSE 2007: 61-70 - [c30]Ron van der Meyden, Thomas Wilke:
Preservation of epistemic properties in security protocol implementations. TARK 2007: 212-221 - 2006
- [j13]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) - [c29]Carsten Fritz, Thomas Wilke:
Simulation Relations for Alternating Parity Automata and Parity Games. Developments in Language Theory 2006: 59-70 - [c28]Detlef Kähler, Ralf Küsters, Thomas Wilke:
A Dolev-Yao-Based Definition of Abuse-Free Protocols. ICALP (2) 2006: 95-106 - 2005
- [j12]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) - [j11]Carsten Fritz, Thomas Wilke:
Simulation relations for alternating Büchi automata. Theor. Comput. Sci. 338(1-3): 275-314 (2005) - [c27]Ron van der Meyden, Thomas Wilke:
Synthesis of Distributed Systems from Knowledge-Based Specifications. CONCUR 2005: 562-576 - [c26]Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding Properties of Contract-Signing Protocols. STACS 2005: 158-169 - 2004
- [j10]Denis Thérien, Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. 37(1): 111-131 (2004) - [c25]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 - [c24]Ralf Küsters, Thomas Wilke:
Automata-Based Analysis of Recursive Cryptographic Protocols. STACS 2004: 382-393 - 2003
- [c23]Detlef Kähler, Thomas Wilke:
Program Complexity of Dynamic LTL Model Checking. CSL 2003: 271-284 - [c22]Thomas Wilke:
Minimizing Automata on Infinite Words. LPAR 2003: 289 - 2002
- [j9]Kousha Etessami, Moshe Y. Vardi, Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179(2): 279-295 (2002) - [c21]Carsten Fritz, Thomas Wilke:
State Space Reductions for Alternating Büchi Automata. FSTTCS 2002: 157-168 - [c20]Ralf Küsters, Thomas Wilke:
Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS 2002: 241-252 - [c19]Denis Thérien, Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic. STACS 2002: 455-464 - [e1]Erich Grädel, Wolfgang Thomas, Thomas Wilke:
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 [contents] - 2001
- [j8]Juraj Hromkovic, Sebastian Seibert, Thomas Wilke:
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62(4): 565-588 (2001) - [j7]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) - [c18]Kousha Etessami, Thomas Wilke, Rebecca A. Schuller:
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP 2001: 694-707 - [c17]Thomas Wilke:
Linear Temporal Logic and Finite Semigroups. MFCS 2001: 96-110 - 2000
- [j6]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)
1990 – 1999
- 1999
- [c16]Thomas Wilke:
CTL+ is Exponentially more Succinct than CTL. FSTTCS 1999: 110-121 - [c15]Martin Dickhöfer, Thomas Wilke:
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. ICALP 1999: 281-290 - [c14]Thomas Wilke:
Classifying Discrete Temporal Properties. STACS 1999: 32-46 - 1998
- [j5]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): 183-203 (1998) - [c13]Denis Thérien, Thomas Wilke:
Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC 1998: 234-240 - 1997
- [j4]Doron A. Peled, Thomas Wilke:
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. 63(5): 243-246 (1997) - [c12]Sebastian Seibert, Thomas Wilke:
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms 1997: 179-212 - [c11]Thomas Wilke:
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. ICALP 1997: 347-357 - [c10]Kousha Etessami, Moshe Y. Vardi, Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic. LICS 1997: 228-235 - [c9]Juraj Hromkovic, Sebastian Seibert, Thomas Wilke:
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66 - 1996
- [j3]Thomas Wilke, Haiseung Yoo:
Computing the Rabin Index of a Regular Language of Infinite Words. Inf. Comput. 130(1): 61-70 (1996) - [j2]Thomas Wilke:
An Algebraic Characterization of Frontier Testable Tree Languages. Theor. Comput. Sci. 154(1): 85-106 (1996) - [c8]Doron A. Peled, Thomas Wilke, Pierre Wolper:
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996: 596-610 - [c7]Denis Thérien, Thomas Wilke:
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS 1996: 256-263 - [c6]Kousha Etessami, Thomas Wilke:
An Until Hierarchy for Temporal Logic. LICS 1996: 108-117 - 1995
- [c5]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 - 1994
- [b1]Thomas Wilke:
Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. University of Kiel, Germany, 1994, pp. 1-168 - [c4]Thomas Wilke:
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. FTRTFT 1994: 694-715 - 1993
- [j1]Thomas Wilke:
An Algebraic Theory for Regular Languages of Finite and Infinite Words. Int. J. Algebra Comput. 3(4): 447-490 (1993) - [c3]Thomas Wilke:
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. ICALP 1993: 347-358 - [c2]Thomas Wilke:
Locally Threshold Testable Languages of Infinite Words. STACS 1993: 607-616 - 1991
- [c1]Thomas Wilke:
An Eilenberg Theorem for Infinity-Languages. ICALP 1991: 588-599
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
