Travelled to:1 × Austria
1 × Czech Republic
1 × Estonia
1 × France
1 × Greece
1 × Iceland
1 × Norway
1 × Poland
1 × Spain
1 × Sweden
3 × Italy
4 × USA
Collaborated with:∅ D.Kähler K.Etessami M.Y.Vardi S.Preugschat C.Fritz M.Dickhöfer D.Thérien H.Yoo S.Fischer F.Huch R.Küsters R.A.Schuller S.Fogarty O.Kupferman M.Benedikt C.Löding J.V.d.Bussche
Talks about:automata (6) logic (5) regular (4) languag (3) express (3) tempor (3) pariti (3) altern (3) order (3) first (3)
Person: Thomas Wilke
DBLP: Wilke:Thomas
Contributed to:
2012
2011
2011
2010
200820062006
2004200320011999
19981997
1997199619931991
1995Wrote 18 papers:
- FoSSaCS-2012-PreugschatW #automaton #effectiveness #logic #using
- Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.
- CSL-2011-FogartyKVW #automaton
- Unifying Büchi Complementation Constructions (SF, OK, MYV, TW), pp. 248–263.
- DLT-2011-Wilke #functional #regular expression
- A Functional Program for Regular Expressions Matching — Abstract of Invited Talk (TW), pp. 44–45.
- ICFP-2010-FischerHW #functional #game studies #regular expression
- A play on regular expressions: functional pearl (SF, FH, TW), pp. 357–368.
- ICALP-A-2008-KahlerW #ambiguity #automaton
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified (DK, TW), pp. 724–735.
- DLT-2006-FritzW #automaton #game studies #simulation
- Simulation Relations for Alternating Parity Automata and Parity Games (CF, TW), pp. 59–70.
- ICALP-v2-2006-KahlerKW #protocol
- A Dolev-Yao-Based Definition of Abuse-Free Protocols (DK, RK, TW), pp. 95–106.
- PODS-2004-BenediktLBW #first-order
- A Characterization of First-Order Topological Properties of Planar Spatial Data (MB, CL, JVdB, TW), pp. 107–114.
- CSL-2003-KahlerW #complexity #ltl #model checking
- Program Complexity of Dynamic LTL Model Checking (DK, TW), pp. 271–284.
- ICALP-2001-EtessamiWS #automaton #game studies #reduction #simulation
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.
- ICALP-1999-DickhoferW #automaton #model checking #problem
- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem (MD, TW), pp. 281–290.
- STOC-1998-TherienW #quantifier #word
- Over Words, Two Variables Are as Powerful as One Quantifier Alternation (DT, TW), pp. 234–240.
- ICALP-1997-Wilke #first-order #logic #strict
- Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
- LICS-1997-EtessamiVW #first-order #logic
- First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.
- LICS-1996-EtessamiW #logic
- An Until Hierarchy for Temporal Logic (KE, TW), pp. 108–117.
- ICALP-1993-Wilke #algebra #testing
- Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability (TW), pp. 347–358.
- ICALP-1991-Wilke #theorem
- An Eilenberg Theorem for Infinity-Languages (TW), pp. 588–599.
- TAPSOFT-1995-WilkeY #infinity #polynomial #regular expression #word
- Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time (TW, HY), pp. 288–302.