Thomas Wilke

Affiliations:
  • University of Kiel, Germany


According to our database1, Thomas Wilke authored at least 73 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Classification of freshwater snails of the genus Radomaniola with multimodal triplet networks.
CoRR, 2024

2021
ω-Automata.
Proceedings of the Handbook of Automata Theory., 2021

2020
Visually Representing History Dependencies in Event Logs.
Proceedings of the Process Mining Workshops, 2020

2019
Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods.
Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

2017
Backward deterministic and weak alternating ω-automata.
CoRR, 2017

Backward Deterministic Büchi Automata on Infinite Words.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
ω-Automata.
CoRR, 2016

Past, Present, and Infinite Future.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Preface of STACS 2012 Special Issue.
Theory Comput. Syst., 2014

2013
Veranstaltungskalender.
LOG IN, 2013

Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
Log. Methods Comput. Sci., 2013

Unifying Büchi Complementation Constructions
Log. Methods Comput. Sci., 2013

Profile Trees for Büchi Word Automata, with Application to Determinization.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Complexity and Unwinding for Intransitive Noninterference.
CoRR, 2013

Author Index.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Frontmatter, Table of Contents, Preface, Workshop Organization.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Noninterference with Local Policies.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Dynamic Noninterference: Consistent Policies, Characterizations and Verification
CoRR, 2012

Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
The Complexity of Intransitive Noninterference.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

A Functional Program for Regular Expressions Matching - Abstract of Invited Talk.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Moderne Kryptographie - Eine Einführung.
Vieweg + Teubner, ISBN: 978-3-519-00509-4, 2011

2010
Deciding strategy properties of contract-signing protocols.
ACM Trans. Comput. Log., 2010

A play on regular expressions: functional pearl.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

2009
A Simulation-Based Treatment of Authenticated Message Exchange.
IACR Cryptol. ePrint Arch., 2009

Computationally Secure Two-Round Authenticated Message Exchange.
IACR Cryptol. ePrint Arch., 2009

Computationally Sound Analysis of a Probabilistic Contract Signing Protocol.
Proceedings of the Computer Security, 2009

2008
Complementation, Disambiguation, and Determinization of Büchi Automata Unified.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Automata: from logics to algorithms.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Transducer-based analysis of cryptographic protocols.
Inf. Comput., 2007

Preservation of epistemic properties in security protocol implementations.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

Selecting theories and nonce generation for recursive protocols.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

2006
A characterization of first-order topological properties of planar spatial data.
J. ACM, 2006

A Dolev-Yao-Based Definition of Abuse-Free Protocols.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Simulation Relations for Alternating Parity Automata and Parity Games.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Simulation relations for alternating Büchi automata.
Theor. Comput. Sci., 2005

Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata.
SIAM J. Comput., 2005

Deciding Properties of Contract-Signing Protocols.
Proceedings of the STACS 2005, 2005

Synthesis of Distributed Systems from Knowledge-Based Specifications.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Nesting Until and Since in Linear Temporal Logic.
Theory Comput. Syst., 2004

Automata-Based Analysis of Recursive Cryptographic Protocols.
Proceedings of the STACS 2004, 2004

A Characterization of First-Order Topological Properties of Planar Spatial Data.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

2003
Minimizing Automata on Infinite Words.
Proceedings of the Logic for Programming, 2003

Program Complexity of Dynamic LTL Model Checking.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
First-Order Logic with Two Variables and Unary Temporal Logic.
Inf. Comput., 2002

Deciding the First Level of the µ-Calculus Alternation Hierarchy.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

State Space Reductions for Alternating Büchi Automata.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
SIAM J. Comput., 2001

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.
J. Comput. Syst. Sci., 2001

Linear Temporal Logic and Finite Semigroups.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic.
Inf. Comput., 2000

1999
Classifying Discrete Temporal Properties.
Proceedings of the STACS 99, 1999

Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem.
Proceedings of the Automata, 1999

CTL<sup>+</sup> is Exponentially more Succinct than CTL.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages.
Theor. Comput. Sci., 1998

Over Words, Two Variables Are as Powerful as One Quantifier Alternation.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator.
Inf. Process. Lett., 1997

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996
An Algebraic Characterization of Frontier Testable Tree Languages.
Theor. Comput. Sci., 1996

Computing the Rabin Index of a Regular Language of Infinite Words.
Inf. Comput., 1996

An Until Hierarchy for Temporal Logic.
Proceedings of the Proceedings, 1996

An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.
Proceedings of the CONCUR '96, 1996

1995
Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1994
Automaten und Logiken zur Beschreibung zeitabhängiger Systeme.
PhD thesis, 1994

Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, 1994

1993
An Algebraic Theory for Regular Languages of Finite and Infinite Words.
Int. J. Algebra Comput., 1993

Locally Threshold Testable Languages of Infinite Words.
Proceedings of the STACS 93, 1993

Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1991
An Eilenberg Theorem for Infinity-Languages.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991


  Loading...