Prof. Dr. Thomas Wilke

Prof. Dr. Thomas Wilke

Funktion function Leiter der Arbeitsgruppe head of group
Telefon phone +49 (0)431 880 7511
Fax +49 (0)431 880 7614
E-Mail wilke@ti.informatik.uni-kiel.de
PGP/GPG Key C5F0:FC49:53DD:D453:8FA3:22DB:554C:A95E:1043:07E7
Dienstzimmer office CAP4, 1013
Sprechzeiten office hours nach Absprache

Table of Contents

  1. nomination for EATCS council election
  2. research interests
  3. professional activities
  4. publications

Nomination for EATCS Council Election

On July 7, during this year’s EATCS general assembly, I was nominated for the
EACTS council elections in automn. Here is my brief statement expressing my
view on the future of EACTS:

EATCS has been very successful in promoting the development of theoretical
computer science by organizing ICALP, but also by publishing or supporting
publication of work in theoretical computer science in print. Recently, EATCS
has explored new ways in publication by making its valuable Bulletin available
for download. In the future, I would like to see more online publications,
more precisely, I am in favor of making ICALP proceedings open access—for
the benefit of the entire theory community and, in particular, our students.

Research Interests

I am interested in cryptography, especially cryptographic protocols, automata
theory, mathematical logic, and verification. Within these fields my research
focusses on

  • design, specification, and analysis of cryptographic protocols,
  • automatic verification, especially model checking,
  • expressiveness and algorithmic properties of specification logics,
    especially linear temporal logic,
  • algebraic and logical treatment of formal languages,
  • algorithmic treatment of (finite) automata.

Professional Activities

Currently, I am member of the editorial boards of

and I encourage everyone to consider these journals and series for publishing his or her results in them. Please, don’t hesitate to contact me if you have any questions or doubts.

I have served on many program committees; recent and upcoming conferences and workshops I am on the PC include:

Please, consider these conferences for publishing your latest results.

I am an active member of the Gesellschaft für Informatik e.V. Until 2008, I was a member of Leitungsgremium der Fachgruppe Logik in der Informatik. Currenly, I am the acting speaker of Fachbereich Grundlagen der Informatik (FB GInf).

Publications

2009

[KurtzSchnoorWilke-ASIAN-2009 | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "A Simulation-Based Treatment of Authenticated Message Exchange," in Advances in Computer Science – ASIAN 2009, 14th Asian Computing Science Conference, Proceedings, 2009.

@InProceedings{KurtzSchnoorWilke-ASIAN-2009,
  author = {K{\"u}rtz, Klaas Ole and Schnoor, Henning and Wilke, Thomas},
  title = {A Simulation-Based Treatment of Authenticated Message Exchange},
  booktitle = {Advances in Computer Science - ASIAN 2009, 14th Asian Computing Science Conference, Proceedings},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  year = {2009},
  note = {To appear}
}

[KahlerKustersWilke-TOCL-2009 | .bib]

D. Kähler, R. Küsters, and T. Wilke, "Deciding properties of contract-signing protocols," Transactions on Computational Logic, 2009.

@Article{KahlerKustersWilke-TOCL-2009,
  author = {Kähler, Detlef and Küsters, Ralf and Wilke, Thomas},
  title = {Deciding properties of contract-signing protocols},
  journal = {Transactions on Computational Logic},
  year = 2009}

[AizatulinSchnoorWilke-ESORICS-2009 | .bib]

M. Aizatulin, H. Schnoor, and T. Wilke, "Computationally Sound Analysis of a Probabilistic Contract Signing Protocol," in Computer Security – ESORICS 2009, 14th European Symposium on Research in Computer Security, Saint Malo, France, September 21-25, 2008. Proceedings, 2009.

@InProceedings{AizatulinSchnoorWilke-ESORICS-2009,
  author = {Aizatulin, Mihhail and Schnoor, Henning and Wilke, Thomas},
  title = {Computationally Sound Analysis of a Probabilistic Contract Signing Protocol},
  booktitle = {Computer Security - ESORICS 2009, 14th European Symposium on Research in Computer Security, Saint Malo, France, September 21-25, 2008. Proceedings},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  year = {2009},
  note = {To appear}
}

[KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009 | .bib]

K. O. Kuertz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", 2009.

@TechReport{KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009,
  author = {Klaas Ole Kuertz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  howpublished = {Cryptology ePrint Archive, Report 2009/262},
  year = {2009}
}

2008

[KahlerWilke-ICALP-2008 | .bib]

D. Kähler and T. Wilke, "Complementation, Disambiguation, and Determinization of Büchi Automata Unified," in Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, 2008, pp. 724-735.

@inproceedings{KahlerWilke-ICALP-2008,
  author = {Detlef K{\"a}hler and Thomas Wilke},
  title = {Complementation, Disambiguation, and Determinization of B{\"u}chi Automata Unified},
  booktitle = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games},
  editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'u}s M. Halld{\'o}rsson and Anna Ing{\'o}lfsd{\'o}ttir and Igor Walukiewicz},
  year = {2008},
  pages = {724-735},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {5125}
}

[KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008 | .pdf | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0809, 2008.

@TechReport{KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008,
  author = {Klaas Ole K\"urtz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2008},
  number = {0809},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr0810.pdf}
}

2007

[KurtzKustersWilke-2007 | .bib]

K. O. Kürtz, R. Küsters, and T. Wilke, "Selecting Theories and Nonce Generation for Recursive Protocols." 2007, pp. 61-70.

@INPROCEEDINGS{KurtzKustersWilke-2007,
  author = {Klaas Ole Kürtz and Ralf Küsters and Thomas Wilke},
  title = {Selecting Theories and Nonce Generation for Recursive Protocols},
  year = {2007},
  crossref = {DBLP:conf/ccs/2007fmse},
  pages = {61--70},
  publisher = {ACM},
  doi = {10.1145/1314436.1314445}
}

[MeydenWilke-2007 | .bib]

R. van der Meyden and T. Wilke, "Preservation of epistemic properties in security protocol implementations," in TARK ‘07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge, New York, NY, USA, 2007, pp. 212-221.

@INPROCEEDINGS{MeydenWilke-2007,
  author = {Ron van der Meyden and Thomas Wilke},
  title = {Preservation of epistemic properties in security protocol implementations},
  year = {2007},
  booktitle = {TARK '07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge},
  pages = {212--221},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1324249.1324278},
  location = {Brussels, Belgium}
}

[KustersWilke-IC-2007 | .bib]

R. Küsters and T. Wilke, "Transducer-based analysis of cryptographic protocols," Inf. Comput., vol. 205, iss. 12, pp. 1741-1776, 2007.

@ARTICLE{KustersWilke-IC-2007,
  author = {Ralf Küsters and Thomas Wilke},
  title = {Transducer-based analysis of cryptographic protocols},
  journal = {Inf. Comput.},
  year = {2007},
  volume = {205},
  pages = {1741--1776},
  number = {12},
  address = {Duluth, MN, USA},
  doi = {http://dx.doi.org/10.1016/j.ic.2007.08.003},
  issn = {0890-5401},
  publisher = {Academic Press, Inc.}
}

[VardiWilke-2007 | .bib]

M. Y. Vardi and T. Wilke, "Automata: from logics to algorithms," , Flum, J., Grädel, E., and Wilke, T., Eds., Amsterdam: Amsterdam University Press, 2007, pp. 629-736.

@INCOLLECTION{VardiWilke-2007,
  author = {Vardi, Moshe Y. and Thomas Wilke},
  title = {Automata: from logics to algorithms},
  booktitle = {Logic and Automata: History and Perspectives},
  publisher = {Amsterdam University Press},
  year = {2007},
  editor = {Jörg Flum and Erich Grädel and Thomas Wilke},
  number = {2},
  series = {Texts in Logic and Games},
  pages = {629--736},
  address = {Amsterdam}
}

2006

[KahlerKustersWilke-2006 | .bib]

D. Kähler, R. Küsters, and T. Wilke, "A Dolev-Yao-Based Definition of Abuse-Free Protocols," in ICALP (2), 2006, pp. 95-106.

@INPROCEEDINGS{KahlerKustersWilke-2006,
  author = {Detlef Kähler and Ralf Küsters and Thomas Wilke},
  title = {A Dolev-Yao-Based Definition of Abuse-Free Protocols},
  year = {2006},
  crossref = {DBLP:conf/icalp/2006-2},
  booktitle = {ICALP (2)},
  pages = {95--106},
  ee = {http://dx.doi.org/10.1007/11787006_9}
}

[FritzWilke-2006 | .bib]

C. Fritz and T. Wilke, "Simulation Relations for Alternating Parity Automata and Parity Games," in Developments in Language Theory, 2006, pp. 59-70.

@INPROCEEDINGS{FritzWilke-2006,
  author = {Carsten Fritz and Thomas Wilke},
  title = {Simulation Relations for Alternating Parity Automata and Parity Games},
  year = {2006},
  crossref = {DBLP:conf/dlt/2006},
  booktitle = {Developments in Language Theory},
  pages = {59--70},
  ee = {http://dx.doi.org/10.1007/11779148_7}
}

[BenediktKuijpersLodingEtAl-JA-2006 | .bib]

M. Benedikt, B. Kuijpers, C. Löding, J. V. den Bussche, and T. Wilke, "A characterization of first-order topological properties of planar spatial data," J. ACM, vol. 53, iss. 2, pp. 273-305, 2006.

@ARTICLE{BenediktKuijpersLodingEtAl-JA-2006,
  author = {Michael Benedikt and Bart Kuijpers and Christof Löding and Jan Van den Bussche and Thomas Wilke},
  title = {A characterization of first-order topological properties of planar spatial data},
  journal = {J. ACM},
  year = {2006},
  volume = {53},
  pages = {273--305},
  number = {2}
}

2005

[EtessamiWilkeSchuller-SJC-2005 | .bib]

K. Etessami, T. Wilke, and R. A. Schuller, "Fair simulation relations, parity games, and state space reduction for Büchi automata," SIAM J. Comput., vol. 34, iss. 5, pp. 1159-1175, 2005.

@ARTICLE{EtessamiWilkeSchuller-SJC-2005,
  author = {Kousha Etessami and Thomas Wilke and Rebecca A. Schuller},
  title = {Fair simulation relations, parity games, and state space reduction for {B}üchi automata},
  journal = {SIAM J. Comput.},
  year = {2005},
  volume = {34},
  pages = {1159--1175},
  number = {5},
  ee = {http://dx.doi.org/10.1137/S0097539703420675}
}

[FritzWilke-TCS-2005 | .bib]

C. Fritz and T. Wilke, "Simulation relations for alternating Büchi automata," Theor. Comput. Sci., vol. 338, iss. 1–3, pp. 275-314, 2005.

@ARTICLE{FritzWilke-TCS-2005,
  author = {Carsten Fritz and Thomas Wilke},
  title = {Simulation relations for alternating {B}üchi automata},
  journal = {Theor. Comput. Sci.},
  year = {2005},
  volume = {338},
  pages = {275--314},
  number = {1--3},
  ee = {http://dx.doi.org/10.1016/j.tcs.2005.01.016}
}

[KahlerKustersWilke-2005 | .bib]

D. Kähler, R. Küsters, and T. Wilke, "Deciding Properties of Contract-Signing Protocols," in STACS, 2005, pp. 158-169.

@INPROCEEDINGS{KahlerKustersWilke-2005,
  author = {Detlef Kähler and Ralf Küsters and Thomas Wilke},
  title = {Deciding Properties of Contract-Signing Protocols},
  year = {2005},
  crossref = {DBLP:conf/stacs/2005},
  booktitle = {STACS},
  pages = {158-169}
}

[MeydenWilke-2005 | .bib]

R. van der Meyden and T. Wilke, "Synthesis of Distributed Systems from Knowledge-Based Specifications," in CONCUR, 2005, pp. 562-576.

@INPROCEEDINGS{MeydenWilke-2005,
  author = {Ron van der Meyden and Thomas Wilke},
  title = {Synthesis of Distributed Systems from Knowledge-Based Specifications},
  year = {2005},
  crossref = {DBLP:conf/concur/2005},
  booktitle = {CONCUR},
  pages = {562-576},
  ee = {http://dx.doi.org/10.1007/11539452_42}
}

2004

[BenediktLodingBusscheEtAl-2004 | .bib]

M. Benedikt, C. Löding, J. V. den Bussche, and T. Wilke, "A Characterization of First-Order Topological Properties of Planar Spatial Data," in PODS, 2004, pp. 107-114.

@INPROCEEDINGS{BenediktLodingBusscheEtAl-2004,
  author = {Michael Benedikt and Christof Löding and Jan Van den Bussche and Thomas Wilke},
  title = {A Characterization of First-Order Topological Properties of Planar Spatial Data},
  year = {2004},
  crossref = {DBLP:conf/pods/2004},
  booktitle = {PODS},
  pages = {107--114},
  ee = {http://doi.acm.org/10.1145/1055558.1055575}
}

[TherienWilke-TCS-2004 | .bib]

D. Thérien and T. Wilke, "Nesting until and since in linear temporal logic," Theory Comput. Syst., vol. 37, iss. 1, pp. 111-131, 2004.

@ARTICLE{TherienWilke-TCS-2004,
  author = {Denis Thérien and Thomas Wilke},
  title = {Nesting until and since in linear temporal logic},
  journal = {Theory Comput. Syst.},
  year = {2004},
  volume = {37},
  pages = {111--131},
  number = {1},
  ee = {http://dx.doi.org/10.1007/s00224-003-1109-3}
}

[KustersWilke-2004 | .bib]

R. Küsters and T. Wilke, "Automata-Based Analysis of Recursive Cryptographic Protocols," in STACS, 2004, pp. 382-393.

@INPROCEEDINGS{KustersWilke-2004,
  author = {Ralf Küsters and Thomas Wilke},
  title = {Automata-Based Analysis of Recursive Cryptographic Protocols},
  year = {2004},
  crossref = {DBLP:conf/stacs/2004},
  booktitle = {STACS},
  pages = {382--393}
}

2003

[KahlerWilke-2003 | .bib]

D. Kähler and T. Wilke, "Program Complexity of Dynamic LTL Model Checking," in CSL, 2003, pp. 271-284.

@INPROCEEDINGS{KahlerWilke-2003,
  author = {Detlef Kähler and Thomas Wilke},
  title = {Program Complexity of Dynamic LTL Model Checking},
  year = {2003},
  crossref = {DBLP:conf/csl/2003},
  booktitle = {CSL},
  pages = {271-284}
}

[Wilke-2003 | .bib]

T. Wilke, "Minimizing Automata on Infinite Words," in LPAR, 2003, p. 289.

@INPROCEEDINGS{Wilke-2003,
  author = {Thomas Wilke},
  title = {Minimizing Automata on Infinite Words},
  year = {2003},
  crossref = {DBLP:conf/lpar/2003},
  booktitle = {LPAR},
  pages = {289}
}

2002

[FritzWilke-2002 | .bib]

C. Fritz and T. Wilke, "State Space Reductions for Alternating Büchi Automata," in FSTTCS, 2002, pp. 157-168.

@INPROCEEDINGS{FritzWilke-2002,
  author = {Carsten Fritz and Thomas Wilke},
  title = {State Space Reductions for Alternating {B}üchi Automata},
  year = {2002},
  crossref = {DBLP:conf/fsttcs/2002},
  booktitle = {FSTTCS},
  pages = {157-168},
  ee = {http://link.springer.de/link/service/series/0558/bibs/2556/25560157.htm}
}

[EtessamiVardiWilke-IC-2002 | .bib]

K. Etessami, M. Y. Vardi, and T. Wilke, "First-order logic with two variables and unary temporal logic," Inf. Comput., vol. 179, iss. 2, pp. 279-295, 2002.

@ARTICLE{EtessamiVardiWilke-IC-2002,
  author = {Kousha Etessami and Moshe Y. Vardi and Thomas Wilke},
  title = {First-order logic with two variables and unary temporal logic},
  journal = {Inf. Comput.},
  year = {2002},
  volume = {179},
  pages = {279--295},
  number = {2},
  ee = {http://dx.doi.org/10.1006/inco.2001.2953}
}

[TherienWilke-2002 | .bib]

D. Thérien and T. Wilke, "Nesting Until and Since in Linear Temporal Logic," in STACS, 2002, pp. 455-464.

@INPROCEEDINGS{TherienWilke-2002,
  author = {Denis Thérien and Thomas Wilke},
  title = {Nesting Until and Since in Linear Temporal Logic},
  year = {2002},
  crossref = {DBLP:conf/stacs/2002},
  booktitle = {STACS},
  pages = {455-464},
  ee = {http://link.springer.de/link/service/series/0558/bibs/2285/22850455.htm}
}

[Wilke-BBMS-2002 | .bib]

T. Wilke, "Alternating tree automata, parity games, and modal mu-calculus," Bull. Belg. Math. Soc., vol. 8, iss. 2, pp. 359-391, 2002.

@ARTICLE{Wilke-BBMS-2002,
  author = {Thomas Wilke},
  title = {Alternating tree automata, parity games, and modal mu-calculus},
  journal = {Bull. Belg. Math. Soc.},
  year = {2002},
  volume = {8},
  pages = {359--391},
  number = {2}
}

[KustersWilke-2002 | .bib]

R. Küsters and T. Wilke, "Deciding the First Level of the mu-Calculus Alternation Hierarchy," in FSTTCS, 2002, pp. 241-252.

@INPROCEEDINGS{KustersWilke-2002,
  author = {Ralf Küsters and Thomas Wilke},
  title = {Deciding the First Level of the mu-Calculus Alternation Hierarchy},
  year = {2002},
  crossref = {DBLP:conf/fsttcs/2002},
  booktitle = {FSTTCS},
  pages = {241--252}
}

2001

[Wilke-2001 | .bib]

T. Wilke, "Linear Temporal Logic and Finite Semigroups," in MFCS, 2001, pp. 96-110.

@INPROCEEDINGS{Wilke-2001,
  author = {Thomas Wilke},
  title = {Linear Temporal Logic and Finite Semigroups},
  year = {2001},
  crossref = {DBLP:conf/mfcs/2001},
  booktitle = {MFCS},
  pages = {96--110},
  ee = {http://link.springer.de/link/service/series/0558/bibs/2136/21360096.htm}
}

[HromkovivcSeibertWilke-JCSS-2001 | .bib]

J. H. c, S. Seibert, and T. Wilke, "Translating regular expressions into small epsilon-free nondeterministic finite automata," J. Comput. Syst. Sci., vol. 62, iss. 4, pp. 565-588, 2001.

@ARTICLE{HromkovivcSeibertWilke-JCSS-2001,
  author = {Juraj Hromkovi\v{c} and Sebastian Seibert and Thomas Wilke},
  title = {Translating regular expressions into small epsilon-free nondeterministic finite automata},
  journal = {J. Comput. Syst. Sci.},
  year = {2001},
  volume = {62},
  pages = {565--588},
  number = {4}
}

[TherienWilke-SJC-2001 | .bib]

D. Thérien and T. Wilke, "Temporal logic and semidirect products: an effective characterization of the until hierarchy," SIAM J. Comput., vol. 31, iss. 3, pp. 777-798, 2001.

@ARTICLE{TherienWilke-SJC-2001,
  author = {Denis Thérien and Thomas Wilke},
  title = {Temporal logic and semidirect products: an effective characterization of the until hierarchy},
  journal = {SIAM J. Comput.},
  year = {2001},
  volume = {31},
  pages = {777--798},
  number = {3},
  ee = {http://epubs.siam.org/sam-bin/dbq/article/32277}
}

[EtessamiWilkeSchuller-2001 | .bib]

K. Etessami, T. Wilke, and R. A. Schuller, "Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata," in ICALP, 2001, pp. 694-707.

@INPROCEEDINGS{EtessamiWilkeSchuller-2001,
  author = {Kousha Etessami and Thomas Wilke and Rebecca A. Schuller},
  title = {Fair Simulation Relations, Parity Games, and State Space Reduction for {B}üchi Automata},
  year = {2001},
  crossref = {DBLP:conf/icalp/2001},
  booktitle = {ICALP},
  pages = {694--707},
  ee = {http://link.springer.de/link/service/series/0558/bibs/2076/20760694.htm}
}

2000

[EtessamiWilke-IC-2000 | .bib]

K. Etessami and T. Wilke, "An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic," Inf. Comput., vol. 160, iss. 1–2, pp. 88-108, 2000.

@ARTICLE{EtessamiWilke-IC-2000,
  author = {Kousha Etessami and Thomas Wilke},
  title = {An until hierarchy and other applications of an {E}hrenfeucht-Fra{\"i}ssé game for temporal logic},
  journal = {Inf. Comput.},
  year = {2000},
  volume = {160},
  pages = {88--108},
  number = {1--2}
}

1999

[Wilke-1999 | .bib]

T. Wilke, "CTL+ is Exponentially more Succinct than CTL," in FSTTCS, 1999, pp. 110-121.

@INPROCEEDINGS{Wilke-1999,
  author = {Thomas Wilke},
  title = {CTL+ is Exponentially more Succinct than CTL},
  year = {1999},
  crossref = {DBLP:conf/fsttcs/1999},
  booktitle = {FSTTCS},
  pages = {110--121},
  ee = {http://link.springer.de/link/service/series/0558/bibs/1738/17380110.htm}
}

[Wilke-1999a | .bib]

T. Wilke, "Classifying Discrete Temporal Properties," in STACS, 1999, pp. 32-46.

@INPROCEEDINGS{Wilke-1999a,
  author = {Thomas Wilke},
  title = {Classifying Discrete Temporal Properties},
  year = {1999},
  crossref = {DBLP:conf/stacs/1999},
  booktitle = {STACS},
  pages = {32-46},
  ee = {http://link.springer.de/link/service/series/0558/bibs/1563/15630032.htm}
}

[DickhoferWilke-1999 | .bib]

M. Dickhöfer and T. Wilke, "Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem," in ICALP, 1999, pp. 281-290.

@INPROCEEDINGS{DickhoferWilke-1999,
  author = {Martin Dickhöfer and Thomas Wilke},
  title = {Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem},
  year = {1999},
  crossref = {DBLP:conf/icalp/1999},
  booktitle = {ICALP},
  pages = {281--290},
  ee = {http://link.springer.de/link/service/series/0558/bibs/1644/16440281.htm}
}

1998

[Wilke-1998 | .bib]

T. Wilke, "Classifying Temporal Properties in Linear Temporal Logic", PhD Thesis, 1998.

@PHDTHESIS{Wilke-1998,
  author = {Thomas Wilke},
  title = {Classifying Temporal Properties in Linear Temporal Logic},
  school = {Christian-Albrechts-Universität zu Kiel},
  year = {1998},
  type = {Post-doctoral thesis}
}

[PeledWilkeWolper-TCS-1998 | .bib]

D. Peled, T. Wilke, and P. Wolper, "An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages," Theor. Comput. Sci., vol. 195, iss. 2, pp. 183-203, 1998.

@ARTICLE{PeledWilkeWolper-TCS-1998,
  author = {Doron Peled and Thomas Wilke and Pierre Wolper},
  title = {An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages},
  journal = {Theor. Comput. Sci.},
  year = {1998},
  volume = {195},
  pages = {183--203},
  number = {2},
  ee = {http://dx.doi.org/10.1016/S0304-3975(97)00219-3}
}

[TherienWilke-1998 | .bib]

D. Thérien and T. Wilke, "Over Words, Two Variables Are as Powerful as One Quantifier Alternation," in STOC, 1998, pp. 234-240.

@INPROCEEDINGS{TherienWilke-1998,
  author = {Denis Thérien and Thomas Wilke},
  title = {Over Words, Two Variables Are as Powerful as One Quantifier Alternation},
  year = {1998},
  crossref = {conf/stoc/1998},
  booktitle = {STOC},
  pages = {234--240},
  ee = {http://doi.acm.org/10.1145/276698.276749}
}

1997

[HromkovivcSeibertWilke-1997 | .bib]

J. H. c, S. Seibert, and T. Wilke, "Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata," in STACS, 1997, pp. 55-66.

@INPROCEEDINGS{HromkovivcSeibertWilke-1997,
  author = {Juraj Hromkovi\v{c} and Sebastian Seibert and Thomas Wilke},
  title = {Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata},
  year = {1997},
  crossref = {DBLP:conf/stacs/1997},
  booktitle = {STACS},
  pages = {55-66}
}

[SeibertWilke-1997 | .bib]

S. Seibert and T. Wilke, "Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT," in Lectures on Proof Verification and Approximation Algorithms, 1997, pp. 179-212.

@INPROCEEDINGS{SeibertWilke-1997,
  author = {Sebastian Seibert and Thomas Wilke},
  title = {Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT},
  year = {1997},
  crossref = {DBLP:conf/dagstuhl/1997proof},
  booktitle = {Lectures on Proof Verification and Approximation Algorithms},
  pages = {179--212},
  ee = {http://link.springer.de/link/service/series/0558/bibs/1367/13670179.htm}
}

[Wilke-1997 | .bib]

T. Wilke, "Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic," in ICALP, 1997, pp. 347-357.

@INPROCEEDINGS{Wilke-1997,
  author = {Thomas Wilke},
  title = {Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic},
  year = {1997},
  crossref = {DBLP:conf/icalp/1997},
  booktitle = {ICALP},
  pages = {347--357}
}

[PeledWilke-IPL-1997 | .bib]

D. Peled and T. Wilke, "Stutter-invariant temporal properties are expressible without the next-time operator," Inf. Process. Lett., vol. 63, iss. 5, pp. 243-246, 1997.

@ARTICLE{PeledWilke-IPL-1997,
  author = {Doron Peled and Thomas Wilke},
  title = {Stutter-invariant temporal properties are expressible without the next-time operator},
  journal = {Inf. Process. Lett.},
  year = {1997},
  volume = {63},
  pages = {243--246},
  number = {5},
  ee = {http://dx.doi.org/10.1016/S0020-0190(97)00133-6}
}

[EtessamiVardiWilke-1997 | .bib]

K. Etessami, M. Y. Vardi, and T. Wilke, "First-Order Logic with Two Variables and Unary Temporal Logic," in LICS, 1997, pp. 228-235.

@INPROCEEDINGS{EtessamiVardiWilke-1997,
  author = {Kousha Etessami and Moshe Y. Vardi and Thomas Wilke},
  title = {First-Order Logic with Two Variables and Unary Temporal Logic},
  year = {1997},
  crossref = {conf/lics/1997},
  booktitle = {LICS},
  pages = {228--235},
  ee = {http://www.computer.org/proceedings/lics/7925/79250228abs.htm}
}

1996

[Wilke-TCS-1996 | .bib]

T. Wilke, "An algebraic characterization of frontier testable tree languages," Theor. Comput. Sci., vol. 154, iss. 1, pp. 85-106, 1996.

@ARTICLE{Wilke-TCS-1996,
  author = {Thomas Wilke},
  title = {An algebraic characterization of frontier testable tree languages},
  journal = {Theor. Comput. Sci.},
  year = {1996},
  volume = {154},
  pages = {85--106},
  number = {1},
  ee = {http://dx.doi.org/10.1016/0304-3975(95)00131-X}
}

[WilkeYoo-IC-1996 | .bib]

T. Wilke and H. Yoo, "Computing the Rabin index of a regular language of infinite words," Inf. Comput., vol. 130, iss. 1, pp. 61-70, 1996.

@ARTICLE{WilkeYoo-IC-1996,
  author = {Thomas Wilke and Haiseung Yoo},
  title = {Computing the {R}abin index of a regular language of infinite words},
  journal = {Inf. Comput.},
  year = {1996},
  volume = {130},
  pages = {61--70},
  number = {1}
}

[TherienWilke-1996 | .bib]

D. Thérien and T. Wilke, "Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy," in FOCS, 1996, pp. 256-263.

@INPROCEEDINGS{TherienWilke-1996,
  author = {Denis Thérien and Thomas Wilke},
  title = {Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy},
  year = {1996},
  crossref = {conf/focs/1996},
  booktitle = {FOCS},
  pages = {256--263}
}

[EtessamiWilke-1996 | .bib]

K. Etessami and T. Wilke, "An Until Hierarchy for Temporal Logic," in LICS, 1996, pp. 108-117.

@INPROCEEDINGS{EtessamiWilke-1996,
  author = {Kousha Etessami and Thomas Wilke},
  title = {An Until Hierarchy for Temporal Logic},
  year = {1996},
  crossref = {conf/lics/1996},
  booktitle = {LICS},
  pages = {108--117}
}

[PeledWilkeWolper-1996 | .bib]

D. Peled, T. Wilke, and P. Wolper, "An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages," in CONCUR, 1996, pp. 596-610.

@INPROCEEDINGS{PeledWilkeWolper-1996,
  author = {Doron Peled and Thomas Wilke and Pierre Wolper},
  title = {An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages},
  year = {1996},
  crossref = {DBLP:conf/concur/1996},
  booktitle = {CONCUR},
  pages = {596--610}
}

1995

[WilkeYoo-1995 | .bib]

T. Wilke and H. Yoo, "Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time," in TAPSOFT, 1995, pp. 288-302.

@INPROCEEDINGS{WilkeYoo-1995,
  author = {Thomas Wilke and Haiseung Yoo},
  title = {Computing the {W}adge Degree, the {L}ifschitz Degree, and the {R}abin Index of a Regular Language of Infinite Words in Polynomial Time},
  year = {1995},
  crossref = {DBLP:conf/tapsoft/1995},
  booktitle = {TAPSOFT},
  pages = {288--302}
}

1994

[Wilke-1994 | .bib]

T. Wilke, "Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata," in FTRTFT, 1994, pp. 694-715.

@INPROCEEDINGS{Wilke-1994,
  author = {Thomas Wilke},
  title = {Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata},
  year = {1994},
  crossref = {DBLP:conf/ftrtft/1994},
  booktitle = {FTRTFT},
  pages = {694--715}
}

[Wilke-1994a | .bib]

T. Wilke, "Automaten und Logiken für zeitabhängige Systeme", PhD Thesis, 1994.

@PHDTHESIS{Wilke-1994a,
  author = {Thomas Wilke},
  title = {Automaten und Logiken für zeitabhängige Systeme},
  school = {Christian-Albrechts-Universität zu Kiel},
  year = {1994},
  type = {Dissertation}
}

1993

[Wilke-1993 | .bib]

T. Wilke, "Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability," in ICALP, 1993, pp. 347-358.

@INPROCEEDINGS{Wilke-1993,
  author = {Thomas Wilke},
  title = {Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability},
  year = {1993},
  crossref = {DBLP:conf/icalp/1993},
  booktitle = {ICALP},
  pages = {347--358}
}

[Wilke-1993a | .bib]

T. Wilke, "Locally Threshold Testable Languages of Infinite Words," in STACS, 1993, pp. 607-616.

@INPROCEEDINGS{Wilke-1993a,
  author = {Thomas Wilke},
  title = {Locally Threshold Testable Languages of Infinite Words},
  year = {1993},
  crossref = {DBLP:conf/stacs/1993},
  booktitle = {STACS},
  pages = {607--616}
}

[Wilke-IJAaC-1993 | .bib]

T. Wilke, "An algebraic theory for regular languages of finite and infinite words," Intern. J. Algebra and Comput, vol. 3, iss. 4, pp. 447-489, 1993.

@ARTICLE{Wilke-IJAaC-1993,
  author = {Thomas Wilke},
  title = {An algebraic theory for regular languages of finite and infinite words},
  journal = {Intern. J. Algebra and Comput},
  year = {1993},
  volume = {3},
  pages = {447--489},
  number = {4}
}

1991

[Wilke-1991 | .bib]

T. Wilke, "An Eilenberg Theorem for Infinity-Languages," in ICALP, 1991, pp. 588-599.

@INPROCEEDINGS{Wilke-1991,
  author = {Thomas Wilke},
  title = {An {E}ilenberg Theorem for Infinity-Languages},
  year = {1991},
  crossref = {DBLP:conf/icalp/1991},
  booktitle = {ICALP},
  pages = {588--599}
}