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.
Thomas Schwentick
2010 – today
- 2013
[j41]Christoph Dürr, Thomas Schwentick: Preface of Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 53(2): 123-125 (2013)
[c78]Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki: On optimum left-to-right strategies for active context-free games. ICDT 2013: 105-116
[c77]
[c76]Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick: Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189
[c75]Henrik Björklund, Wim Martens, Thomas Schwentick: Validity of Tree Pattern Queries with Respect to Schema Information. MFCS 2013: 171-182
[c74]Thomas Zeume, Thomas Schwentick: On the Quantifier-Free Dynamic Complexity of Reachability. MFCS 2013: 837-848
[c73]
[c72]
[i15]Thomas Zeume, Thomas Schwentick: On the quantifier-free dynamic complexity of Reachability. CoRR abs/1306.3056 (2013)
[i14]Amaldev Manuel, Thomas Schwentick, Thomas Zeume: A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR abs/1306.3418 (2013)- 2012
[j40]Thomas Schwentick, Thomas Zeume: Two-Variable Logic with Two Order Relations. Logical Methods in Computer Science 8(1) (2012)
[j39]Jean-Yves Marion, Thomas Schwentick: Theoretical Aspects of Computer Science. Theory Comput. Syst. 51(2): 123-124 (2012)
[j38]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick: Developing and Analyzing XSDs through BonXai. PVLDB 5(12): 1994-1997 (2012)
[j37]Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3): 19 (2012)
[c71]
[c70]Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. KR 2012
[c69]Ahmet Kara, Thomas Schwentick, Tony Tan: Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA 2012: 351-362
[i13]Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki: On optimum left-to-right strategies for active context-free games. CoRR abs/1212.3501 (2012)- 2011
[j36]Nicole Schweikardt, Thomas Schwentick: A note on the expressive power of linear orders. Logical Methods in Computer Science 7(4) (2011)
[j35]Ahmet Kara, Thomas Schwentick: Expressiveness of Hybrid Temporal Logic on Data Words. Electr. Notes Theor. Comput. Sci. 278: 115-128 (2011)
[j34]Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011)
[j33]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27 (2011)
[c68]Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. Description Logics 2011
[c67]Matthias Niewerth, Thomas Schwentick: Two-variable logic and key constraints on data words. ICDT 2011: 138-149
[c66]Thomas Schwentick, Christoph Dürr: Frontmatter, Table of Contents, Preface, Conference Organization. STACS 2011
[e6]Maurizio Lenzerini, Thomas Schwentick (Eds.): Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece. ACM 2011, ISBN 978-1-4503-0660-7
[e5]Thomas Schwentick, Christoph Dürr (Eds.): 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs 9, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011, ISBN 978-3-939897-25-5
[i12]Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. CoRR abs/1106.3767 (2011)
[i11]Ahmet Kara, Thomas Schwentick, Tony Tan: Feasible Automata for Two-Variable Logic with Successor on Data Words. CoRR abs/1110.1221 (2011)
[i10]Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin: Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports 1(10): 37-57 (2011)- 2010
[j32]Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick: Logik und Automaten: ein echtes Dreamteam. Informatik Spektrum 33(5): 452-461 (2010)
[j31]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of hybrid logics over transitive frames. J. Applied Logic 8(4): 422-440 (2010)
[j30]Henrik Björklund, Thomas Schwentick: On notions of regularity for data languages. Theor. Comput. Sci. 411(4-5): 702-715 (2010)
[j29]Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2) (2010)
[c65]Thomas Eiter, Georg Gottlob, Thomas Schwentick: The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. Fields of Logic and Computation 2010: 227-250
[c64]Thomas Schwentick, Thomas Zeume: Two-Variable Logic with Two Order Relations - (Extended Abstract). CSL 2010: 499-513
[c63]Ahmet Kara, Thomas Schwentick, Thomas Zeume: Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492
[c62]Wim Martens, Matthias Niewerth, Thomas Schwentick: Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250
[c61]Jean-Yves Marion, Thomas Schwentick: Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 1-6
[c60]Jean-Yves Marion, Thomas Schwentick: Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 7-10
[e4]Jean-Yves Marion, Thomas Schwentick (Eds.): 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. LIPIcs 5, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010, ISBN 978-3-939897-16-3
[i9]Ahmet Kara, Thomas Schwentick, Thomas Zeume: Temporal Logics on Words with Multiple Data Values. CoRR abs/1010.1139 (2010)
2000 – 2009
- 2009
[j28]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)
[j27]Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6) (2009)
[j26]Thomas Schwentick, Henrik Björklund: Volker Weber. Journal of Logic, Language and Information 18(4): 433 (2009)
[j25]
[j24]Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009)
[c59]Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick: Tree Projections: Game Characterization and Computational Aspects. Graph Theory, Computational Intelligence and Thought 2009: 217-226
[c58]Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438
[c57]Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The Dynamic Complexity of Formal Languages. STACS 2009: 481-492
[i8]Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009)- 2008
[j23]Thomas Schwentick, Dan Suciu: Introduction to ICDT 2007 special section. ACM Trans. Database Syst. 33(4) (2008)
[c56]Wim Martens, Frank Neven, Thomas Schwentick: Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530
[c55]
[c54]Henrik Björklund, Wim Martens, Thomas Schwentick: Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143
[c53]Thomas Schwentick: A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). STACS 2008: 17-18
[i7]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames. CoRR abs/0806.4130 (2008)
[i6]Wouter Gelade, Marcel Marquardt, Thomas Schwentick: Dynamic Complexity of Formal Languages. CoRR abs/0812.1915 (2008)- 2007
[j22]
[j21]Volker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007)
[j20]Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)
[c52]Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive Query Containment over Trees. DBPL 2007: 66-80
[c51]
[c50]Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: np-hardness and tractable variants. PODS 2007: 13-22
[c49]Gjergji Kasneci, Thomas Schwentick: The complexity of reasoning about pattern-based XML schemas. PODS 2007: 155-164
[c48]
[e3]Thomas Schwentick, Denis Thérien, Heribert Vollmer (Eds.): Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
[e2]Thomas Schwentick, Dan Suciu (Eds.): Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings. Lecture Notes in Computer Science 4353, Springer 2007, ISBN 3-540-69269-X- 2006
[j19]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)
[j18]Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)
[j17]Anca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006)
[j16]Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)
[c47]Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
[c46]Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
[c45]Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168
[c44]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16
[c43]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19
[c42]Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126
[i5]Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006)- 2005
[c41]Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
[c40]Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005
[c39]Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005
[c38]Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82
[c37]
[c36]Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721
[e1]Frank Neven, Thomas Schwentick, Dan Suciu (Eds.): Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005- 2004
[j15]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)
[j14]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004)
[j13]
[j12]Frank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)
[c35]Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149
[c34]Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900
[c33]
[c32]- 2003
[j11]Frank Neven, Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003)
[j10]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003)
[c31]Nils Klarlund, Thomas Schwentick, Dan Suciu: XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41
[c30]Frank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326
[c29]- 2002
[j9]Etienne Grandjean, Thomas Schwentick: Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32(1): 196-230 (2002)
[j8]Frank Neven, Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)- 2001
[j7]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)
[c28]Thomas Eiter, Georg Gottlob, Thomas Schwentick: Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56
[c27]Thomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250
[c26]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440
[c25]Frank Neven, Thomas Schwentick, Victor Vianu: Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572
[c24]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: String Operations in Query Languages. PODS 2001
[c23]Frank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178
[c22]Martin Grohe, Thomas Schwentick, Luc Segoufin: When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666
[i4]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving equations in the relational algebra. CoRR cs.LO/0106034 (2001)- 2000
[j6]Martin Grohe, Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): 112-130 (2000)
[c21]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674
[c20]
[c19]
[c18]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901
[c17]
[c16]Frank Neven, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156
1990 – 1999
- 1999
[j5]Thomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics & Theoretical Computer Science 3(3): 109-124 (1999)
[c15]Frank Neven, Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106
[c14]
[c13]Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152
[c12]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454- 1998
[j4]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998)
[j3]Arnaud Durand, Clemens Lautemann, Thomas Schwentick: Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998)
[c11]
[c10]Martin Grohe, Thomas Schwentick: Locality of Order-Invariant First-Order Formulas. MFCS 1998: 437-445
[c9]Thomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998: 444-454
[i3]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998)
[i2]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. Electronic Colloquium on Computational Complexity (ECCC) 5(59) (1998)- 1997
[c8]Thomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics. CSL 1997: 461-477
[c7]Thomas Schwentick: Algebraic and Logical Characterizations of Deterministic Linear Time Classes. STACS 1997: 463-474- 1996
[j2]Thomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79(1): 61-92 (1996)
[c6]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: On Positive P. IEEE Conference on Computational Complexity 1996: 162-170
[c5]- 1995
[j1]Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán: The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50(3): 456-467 (1995)
[c4]Thomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995: 405-416- 1994
[c3]Clemens Lautemann, Thomas Schwentick, Denis Thérien: Logics For Context-Free Languages. CSL 1994: 205-216
[c2]- 1993
[c1]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Structure in Complexity Theory Conference 1993: 200-207- 1992
[i1]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Bit-Reductions. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:13 CEST by the dblp team



