Thomas Wilke - RankMe

86 papers A* 12A 14B 9C 2Journal 27Unranked 15

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Classification of freshwater snails of the genus Radomaniola with multimodal triplet networks. CoRR Dennis Vetter, Muhammad Ahsan, Diana Delicado, Thomas A. Neubauer, Thomas Wilke, Gemma Roig
2021	—	`ch.`	ω-Automata. Handbook of Automata Theory (I.) Thomas Wilke, Sven Schewe
2020	—	`conf`	Visually Representing History Dependencies in Event Logs. ICPM Workshops Manuel Wetzel, Agnes Koschmider, Thomas Wilke
2019	—	`conf`	Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods. FMTea Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Thomas Wilke
2017	—	`conf`	Backward Deterministic Büchi Automata on Infinite Words. FSTTCS Thomas Wilke
2017	J	`jnl`	Backward deterministic and weak alternating ω-automata. CoRR Sebastian Preugschat, Thomas Wilke
2016	A*	`conf`	Past, Present, and Infinite Future. ICALP Thomas Wilke
2016	J	`jnl`	ω-Automata. CoRR Thomas Wilke
2015	—	`ed.`	Keller, Stack und automatisches Gedächtnis - eine Struktur mit Potenzial, Tagungsband zum Kolloquium, 14. November 2014 in Jena, Deutschland Keller, Stack und automatisches Gedächtnis Michael Fothe, Thomas Wilke
2015	J	`jnl`	Profile trees for Büchi word automata, with application to determinization. Inf. Comput. Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2014	J	`jnl`	Preface of STACS 2012 Special Issue. Theory Comput. Syst. Christoph Dürr, Thomas Wilke
2013	A	`ed.`	30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Kiel, Germany, February 27 - March 2, 2013 STACS Natacha Portier, Thomas Wilke
2013	A	`conf`	Author Index. STACS Natacha Portier, Thomas Wilke
2013	J	`jnl`	Complexity and Unwinding for Intransitive Noninterference. CoRR Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
2013	J	`jnl`	Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata Log. Methods Comput. Sci. Sebastian Preugschat, Thomas Wilke
2013	A	`conf`	Frontmatter, Table of Contents, Preface, Workshop Organization. STACS Natacha Portier, Thomas Wilke
2013	—	`ed.`	Informatik erweitert Horizonte, INFOS 2013, 15. GI-Fachtagung Informatik und Schule, 26.-28. September 2013, Kiel, Germany INFOS Norbert Breier, Peer Stechert, Thomas Wilke
2013	B	`conf`	Noninterference with Local Policies. MFCS Sebastian Eggert, Henning Schnoor, Thomas Wilke
2013	—	`conf`	Profile Trees for Büchi Word Automata, with Application to Determinization. GandALF Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2013	J	`jnl`	Unifying Büchi Complementation Constructions Log. Methods Comput. Sci. Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi
2013	J	`jnl`	Veranstaltungskalender. LOG IN Bernhard Koerber, Thomas Wilke
2012	A	`ed.`	29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, Paris, France, February 29 - March 3, 2012 STACS Christoph Dürr, Thomas Wilke
2012	J	`jnl`	Dynamic Noninterference: Consistent Policies, Characterizations and Verification CoRR Sebastian Eggert, Henning Schnoor, Thomas Wilke
2012	B	`conf`	Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. FoSSaCS Sebastian Preugschat, Thomas Wilke
2012	A	`conf`	Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS Christoph Dürr, Thomas Wilke
2011	C	`conf`	A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. Developments in Language Theory Thomas Wilke
2011	—	`book`	Moderne Kryptographie - Eine Einführung. Ralf Küsters, Thomas Wilke
2011	A*	`conf`	The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
2011	B	`conf`	Unifying Büchi Complementation Constructions. CSL Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2010	A	`conf`	A play on regular expressions: functional pearl. ICFP Sebastian Fischer, Frank Huch, Thomas Wilke
2010	A	`conf`	Computationally secure two-round authenticated message exchange. AsiaCCS Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
2010	J	`jnl`	Deciding strategy properties of contract-signing protocols. ACM Trans. Comput. Log. Detlef Kähler, Ralf Küsters, Thomas Wilke
2009	—	`conf`	A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
2009	J	`jnl`	A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptol. ePrint Arch. Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
2009	J	`jnl`	Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptol. ePrint Arch. Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
2009	A	`conf`	Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
2008	—	`conf`	Automata: from logics to algorithms. Logic and Automata Moshe Y. Vardi, Thomas Wilke
2008	—	`conf`	Complementation, Disambiguation, and Determinization of Büchi Automata Unified. ICALP (1) Detlef Kähler, Thomas Wilke
2008	—	`ed.`	Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Logic and Automata Jörg Flum, Erich Grädel, Thomas Wilke
2007	B	`conf`	Preservation of epistemic properties in security protocol implementations. TARK Ron van der Meyden, Thomas Wilke
2007	—	`conf`	Selecting theories and nonce generation for recursive protocols. FMSE Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke
2007	J	`jnl`	Transducer-based analysis of cryptographic protocols. Inf. Comput. Ralf Küsters, Thomas Wilke
2006	—	`conf`	A Dolev-Yao-Based Definition of Abuse-Free Protocols. ICALP (2) Detlef Kähler, Ralf Küsters, Thomas Wilke
2006	J	`jnl`	A characterization of first-order topological properties of planar spatial data. J. ACM Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
2006	C	`conf`	Simulation Relations for Alternating Parity Automata and Parity Games. Developments in Language Theory Carsten Fritz, Thomas Wilke
2005	A	`conf`	Deciding Properties of Contract-Signing Protocols. STACS Detlef Kähler, Ralf Küsters, Thomas Wilke
2005	J	`jnl`	Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. SIAM J. Comput. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
2005	J	`jnl`	Simulation relations for alternating Büchi automata. Theor. Comput. Sci. Carsten Fritz, Thomas Wilke
2005	B	`conf`	Synthesis of Distributed Systems from Knowledge-Based Specifications. CONCUR Ron van der Meyden, Thomas Wilke
2004	A*	`conf`	A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
2004	A	`conf`	Automata-Based Analysis of Recursive Cryptographic Protocols. STACS Ralf Küsters, Thomas Wilke
2004	J	`jnl`	Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. Denis Thérien, Thomas Wilke
2003	B	`conf`	Minimizing Automata on Infinite Words. LPAR Thomas Wilke
2003	B	`conf`	Program Complexity of Dynamic LTL Model Checking. CSL Detlef Kähler, Thomas Wilke
2002	—	`ed.`	Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001] Automata, Logics, and Infinite Games Erich Grädel, Wolfgang Thomas, Thomas Wilke
2002	—	`conf`	Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS Ralf Küsters, Thomas Wilke
2002	J	`jnl`	First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
2002	A	`conf`	Nesting Until and Since in Linear Temporal Logic. STACS Denis Thérien, Thomas Wilke
2002	—	`conf`	State Space Reductions for Alternating Büchi Automata. FSTTCS Carsten Fritz, Thomas Wilke
2001	A*	`conf`	Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
2001	B	`conf`	Linear Temporal Logic and Finite Semigroups. MFCS Thomas Wilke
2001	J	`jnl`	Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. SIAM J. Comput. Denis Thérien, Thomas Wilke
2001	J	`jnl`	Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
2000	J	`jnl`	An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Inf. Comput. Kousha Etessami, Thomas Wilke
1999	—	`conf`	CTL FSTTCS Thomas Wilke
1999	A	`conf`	Classifying Discrete Temporal Properties. STACS Thomas Wilke
1999	A*	`conf`	Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. ICALP Martin Dickhöfer, Thomas Wilke
1998	J	`jnl`	An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. Theor. Comput. Sci. Doron A. Peled, Thomas Wilke, Pierre Wolper
1998	A*	`conf`	Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC Denis Thérien, Thomas Wilke
1997	—	`conf`	Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms Sebastian Seibert, Thomas Wilke
1997	A*	`conf`	First-Order Logic with Two Variables and Unary Temporal Logic. LICS Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
1997	A*	`conf`	Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. ICALP Thomas Wilke
1997	J	`jnl`	Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. Doron A. Peled, Thomas Wilke
1997	A	`conf`	Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
1996	J	`jnl`	An Algebraic Characterization of Frontier Testable Tree Languages. Theor. Comput. Sci. Thomas Wilke
1996	B	`conf`	An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR Doron A. Peled, Thomas Wilke, Pierre Wolper
1996	A*	`conf`	An Until Hierarchy for Temporal Logic. LICS Kousha Etessami, Thomas Wilke
1996	J	`jnl`	Computing the Rabin Index of a Regular Language of Infinite Words. Inf. Comput. Thomas Wilke, Haiseung Yoo
1996	A*	`conf`	Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS Denis Thérien, Thomas Wilke
1995	—	`conf`	Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time. TAPSOFT Thomas Wilke, Haiseung Yoo
1994	—	`—`	Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. Thomas Wilke
1994	—	`conf`	Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. FTRTFT Thomas Wilke
1993	A*	`conf`	Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. ICALP Thomas Wilke
1993	J	`jnl`	An Algebraic Theory for Regular Languages of Finite and Infinite Words. Int. J. Algebra Comput. Thomas Wilke
1993	A	`conf`	Locally Threshold Testable Languages of Infinite Words. STACS Thomas Wilke
1991	A*	`conf`	An Eilenberg Theorem for Infinity-Languages. ICALP Thomas Wilke