Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Wolfgang Thomas
2010 – today
- 2013
[j29]Sten Grüner, Frank G. Radmacher, Wolfgang Thomas: Connectivity games over dynamic networks. Theor. Comput. Sci. 493: 46-65 (2013)- 2012
[j28]Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas: Degrees of Lookahead in Regular Infinite Games. Logical Methods in Computer Science 8(3) (2012)
[j27]Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas: Languages versus ω-Languages in Regular Infinite Games. Int. J. Found. Comput. Sci. 23(5): 985-1000 (2012)
[j26]
[j25]Uwe Schöning, Wolfgang Thomas: Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. Informatik Spektrum 35(4): 253-260 (2012)
[j24]Dominik Klein, Frank G. Radmacher, Wolfgang Thomas: Moving in a network under random failures: A complexity analysis. Sci. Comput. Program. 77(7-8): 940-954 (2012)
[c67]- 2011
[c66]Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas: Languages vs. ω-Languages in Regular Infinite Games. Developments in Language Theory 2011: 180-191
[c65]
[c64]Ingo Felscher, Wolfgang Thomas: Compositional Failure Detection in Structured Transition Systems. CIAA 2011: 130-141
[c63]Alex Spelten, Wolfgang Thomas, Sarah Winter: Trees over Infinite Structures and Path Logics with Synchronization. INFINITY 2011: 20-34
[c62]Sten Grüner, Frank G. Radmacher, Wolfgang Thomas: Connectivity Games over Dynamic Networks. GandALF 2011: 131-145- 2010
[j23]
[j22]Wolfgang Thomas: Theoretische Informatik - ein Kurzprofil. Informatik Spektrum 33(5): 433-437 (2010)
[j21]Wolfgang Thomas: "When nobody else dreamed of these things" - Axel Thue und die Termersetzung. Informatik Spektrum 33(5): 504-508 (2010)
[j20]Wolfgang Thomas, Pascal Weil: Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46(3): 397 (2010)
[c61]Wolfgang Thomas: On Monadic Theories of Monadic Predicates. Fields of Logic and Computation 2010: 615-626
[c60]Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas: Degrees of Lookahead in Regular Infinite Games. FOSSACS 2010: 252-266
[c59]James Gross, Frank G. Radmacher, Wolfgang Thomas: A Game-Theoretic Approach to Routing under Adversarial Conditions. IFIP TCS 2010: 355-370
2000 – 2009
- 2009
[j19]Ingo Felscher, Wolfgang Thomas: Compositionality and Reachability with Conditions on Path Lengths. Int. J. Found. Comput. Sci. 20(5): 851-868 (2009)
[j18]Wolfgang Thomas, Kai Bollue, Dominique Gückel, Gustavo Quiros, Michaela Slaats, Michael Ummels: DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)" (DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)"). it - Information Technology 51(4): 222-230 (2009)
[c58]
[c57]Paul Hänsch, Michaela Slaats, Wolfgang Thomas: Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. FCT 2009: 181-192
[c56]
[c55]Dominik Klein, Frank G. Radmacher, Wolfgang Thomas: The Complexity of Reachability in Randomized Sabotage Games. FSEN 2009: 162-177
[e9]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Lecture Notes in Computer Science 5555, Springer 2009, ISBN 978-3-642-02926-4
[e8]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II. Lecture Notes in Computer Science 5556, Springer 2009, ISBN 978-3-642-02929-5- 2008
[j17]Frank G. Radmacher, Wolfgang Thomas: A Game Theoretic Approach to the Analysis of Dynamic Networks. Electr. Notes Theor. Comput. Sci. 200(2): 21-37 (2008)
[c54]Florian Horn, Wolfgang Thomas, Nico Wallmeier: Optimal Strategy Synthesis in Request-Response Games. ATVA 2008: 361-373
[c53]Wolfgang Thomas: Church's Problem and a Tour through Automata Theory. Pillars of Computer Science 2008: 635-655
[c52]
[c51]- 2007
[b6]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (5. Aufl.). Spektrum Akademischer Verlag 2007, pp. I-IX, 1-339
[j16]Dieter Stoll, Wolfgang Thomas, Martin Belzner: The role of pseudo-wires for layer 2 services in intelligent transport networks. Bell Labs Technical Journal 12(1): 207-220 (2007)
[j15]Stefan Wöhrle, Wolfgang Thomas: Model Checking Synchronized Products of Infinite Transition Systems. Logical Methods in Computer Science 3(4) (2007)
[c50]
[e7]Wolfgang Thomas, Pascal Weil (Eds.): STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Lecture Notes in Computer Science 4393, Springer 2007, ISBN 978-3-540-70917-6
[i1]Stefan Wöhrle, Wolfgang Thomas: Model Checking Synchronized Products of Infinite Transition Systems. CoRR abs/0710.5659 (2007)- 2006
[j14]Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier: Observations on determinization of Büchi automata. Theor. Comput. Sci. 363(2): 224-233 (2006)
[c49]Alexander Moshe Rabinovich, Wolfgang Thomas: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL 2006: 562-574
[c48]Karianto Wong, Aloys Krieg, Wolfgang Thomas: On Intersection Problems for Polynomially Generated Sets. ICALP (2) 2006: 516-527
[e6]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi (Eds.): Synthesis and Planning, 12.-17. June 2005. Dagstuhl Seminar Proceedings 05241, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
[e5]Bruno Durand, Wolfgang Thomas (Eds.): STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Lecture Notes in Computer Science 3884, Springer 2006, ISBN 3-540-32301-5- 2005
[c47]
[c46]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi: 05241 Executive Summary - Synthesis and Planning. Synthesis and Planning 2005
[c45]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi: 05241 Abstracts Collection - Synthesis and Planning. Synthesis and Planning 2005
[c44]Wolfgang Thomas, Julien Cristau, Christof Löding: Deterministic Automata on Unranked Trees. Foundations of Semistructured Data 2005
[c43]Julien Cristau, Christof Löding, Wolfgang Thomas: Deterministic Automata on Unranked Trees. FCT 2005: 68-79
[c42]Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier: Observations on Determinization of Büchi Automata. CIAA 2005: 262-272- 2004
[c41]Stefan Wöhrle, Wolfgang Thomas: Model Checking Synchronized Products of Infinite Transition Systems. LICS 2004: 2-11- 2003
[j13]
[c40]Philipp Rohde, Wolfgang Thomas: Ein e-Lecture-System für die Theoretische Informatik. DeLFI 2003: 17-26
[c39]
[c38]Nico Wallmeier, Patrick Hütten, Wolfgang Thomas: Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. CIAA 2003: 11-22- 2002
[j12]Olivier Carton, Wolfgang Thomas: The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176(1): 51-65 (2002)
[j11]Oliver Matz, Nicole Schweikardt, Wolfgang Thomas: The Monadic Quantifier Alternation Hierarchy over Grids and Graphs. Inf. Comput. 179(2): 356-383 (2002)
[c37]
[c36]Thierry Cachat, Jacques Duparc, Wolfgang Thomas: Solving Pushdown Games with a Sigma3 Winning Condition. CSL 2002: 322-336
[c35]Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle: Tiling Systems over Infinite Pictures and Their Acceptance Conditions. Developments in Language Theory 2002: 297-306
[e4]Erich Grädel, Wolfgang Thomas, Thomas Wilke (Eds.): 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- 2001
[c34]
[c33]Wolfgang Thomas: A Short Introduction to Infinite Automata. Developments in Language Theory 2001: 130-144
[c32]- 2000
[c31]Christof Löding, Wolfgang Thomas: Alternating Automata and Logics over Infinite Words. IFIP TCS 2000: 521-535
[c30]Olivier Carton, Wolfgang Thomas: The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284
[e3]Grzegorz Rozenberg, Wolfgang Thomas (Eds.): Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. World Scientific 2000, ISBN 981-02-4380-4
1990 – 1999
- 1999
[c29]
[e2]Wolfgang Thomas (Ed.): Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings. Lecture Notes in Computer Science 1578, Springer 1999, ISBN 3-540-65719-3- 1998
[c28]
[e1]Mogens Nielsen, Wolfgang Thomas (Eds.): Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers. Lecture Notes in Computer Science 1414, Springer 1998, ISBN 3-540-64570-5- 1997
[c27]Wolfgang Thomas: Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words. Structures in Logic and Computer Science 1997: 118-143
[c26]Nils Buhrke, Wolfgang Thomas, Jens Vöge: Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik. FBT 1997: 99-108
[c25]Oliver Matz, Wolfgang Thomas: The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. LICS 1997: 236-244
[c24]- 1996
[b5]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (4. Aufl.). Hochschultaschenbuch, Spektrum Akadem. Verl. 1996, ISBN 978-3-8274-0130-4, pp. I-X, 1-309
[j10]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas: Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. Inf. Comput. 125(1): 32-45 (1996)- 1995
[j9]Howard Straubing, Denis Thérien, Wolfgang Thomas: Regular Languages Defined with Generalized Quanifiers. Inf. Comput. 118(2): 289-301 (1995)
[c23]Ina Schiering, Wolfgang Thomas: Counter-Free Automata, First-Order Logic and Star-Free Expressions. Developments in Language Theory 1995: 166-175
[c22]- 1994
[b4]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Mathematical logic (2. ed.). Undergraduate texts in mathematics, Springer 1994, ISBN 978-3-540-94258-0, pp. I-X, 1-289
[c21]
[c20]Wolfgang Thomas: Finite-State Recognizability and Logic: from Words to Graphs. IFIP Congress (1) 1994: 499-506
[c19]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas: Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375- 1993
[c18]Kurt Mehlhorn, Volker Claus, Wolfgang Thomas: Komplexitätstheorie und Algorithmik. Perspektiven der Informatik 1993: 113-116
[c17]
[c16]
[c15]Eija Jurvanen, Andreas Potthoff, Wolfgang Thomas: Tree Languages Recognizable by Regular Frontier Check. Developments in Language Theory 1993: 3-17
[c14]Andreas Potthoff, Wolfgang Thomas: Regular Tree Languages Without Unary Symbols are Star-Free. FCT 1993: 396-405
[c13]Wolfgang Thomas, Helmut Lescow: Logical Specifications of Infinite Computations. REX School/Symposium 1993: 583-621
[c12]Wolfgang Thomas: On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. TAPSOFT 1993: 559-568- 1992
[b3]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (3. Aufl.). BI-Wissenschaftsverlag 1992, ISBN 978-3-411-15603-0, pp. I-X, 1-338
[j8]Wolfgang Thomas: Infinite Trees and Automation-Definable Relations over omega-Words. Theor. Comput. Sci. 103(1): 143-159 (1992)- 1991
[c11]- 1990
[c10]Wolfgang Thomas: Infinite Trees and Automaton Definable Relations over Omega-Words. STACS 1990: 263-277
[p1]Wolfgang Thomas: Automata on Infinite Objects. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 133-192
1980 – 1989
- 1989
[c9]V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth: AMORE: A System for Computing Automata, MOnoidsm and Regular Expressions. STACS 1989: 537-538- 1988
[c8]Howard Straubing, Denis Thérien, Wolfgang Thomas: regular Languages Defined with Generalized Quantifiers. ICALP 1988: 561-575
[c7]Wolfgang Thomas: Automata and quantifier hierarchies. Formal Properties of Finite Automata and Applications 1988: 104-119
[c6]- 1987
[c5]Wolfgang Thomas: A Concatenation Game and the Dot-Depth Hierarchy. Computation Theory and Logic 1987: 415-426
[c4]Thilo Hafer, Wolfgang Thomas: Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree. ICALP 1987: 269-279
[c3]Wolfgang Thomas: On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees. LICS 1987: 245-256- 1986
[j7]- 1985
[j6]Walter Oberschelp, Britta Schinzel, Wolfgang Thomas, Michael M. Richter: European Summer Meeting of the Association for Symbolic Logic: Aachen, 1983. J. Symb. Log. 50(1): 259-283 (1985)- 1984
[b2]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Mathematical logic. Undergraduate texts in mathematics, Springer 1984, ISBN 978-0-387-90895-3, pp. I-IX, 1-216
[c2]- 1983
[c1]- 1982
[j5]Wolfgang Thomas: Classifying Regular Events in Symbolic Logic. J. Comput. Syst. Sci. 25(3): 360-376 (1982)- 1981
[j4]Wolfgang Thomas: A Combinatorial Approach to the Theory of omega-Automata. Information and Control 48(3): 261-283 (1981)
[j3]- 1980
[j2]Wolfgang Thomas: On the Bounded Monadic Theory of Well-Ordered Structures. J. Symb. Log. 45(2): 334-338 (1980)
1970 – 1979
- 1979
[j1]Wolfgang Thomas: Star-Free Regular Sets of omega-Sequences. Information and Control 42(2): 148-156 (1979)- 1975
[b1]Wolfgang Thomas: Das Entscheidungsproblem für einige Erweiterungen der Nachfolger-Arithmetik. Universität Freiburg 1975, pp. 1-103
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:15 CEST by the dblp team



