| 2011 |
|---|
| 112 | Two-variable logic on data words. Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin. ACM Trans. Comput. Log. (12): 27 (2011). Web SearchBibTeXDownload |
| 111 | Feasible Automata for Two-Variable Logic with Successor on Data Words. Ahmet Kara, Thomas Schwentick, Tony Tan. CoRR (abs/1110.1221) (2011). Web SearchBibTeXDownload |
| 110 | Two-Variable Logic with Two Order Relations. Thomas Schwentick, Thomas Zeume. CoRR (abs/1110.1439) (2011). Web SearchBibTeXDownload |
| 109 | Foundations of distributed data management (Dagstuhl Seminar 11421). Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin. Dagstuhl Reports (1): 37-57 (2011). Web SearchBibTeXDownload |
| 108 | Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. Georg Gottlob, Thomas Schwentick. Description Logics 2011. Web SearchBibTeXDownload |
| 107 | Expressiveness of Hybrid Temporal Logic on Data Words. Ahmet Kara, Thomas Schwentick. Electr. Notes Theor. Comput. Sci. (278): 115-128 (2011). Web SearchBibTeXDownload |
| 106 | Two-variable logic and key constraints on data words. Matthias Niewerth, Thomas Schwentick. ICDT 2011, 138-149. Web SearchBibTeXDownload |
| 105 | Conjunctive query containment over trees. Henrik Björklund, Wim Martens, Thomas Schwentick. J. Comput. Syst. Sci. (77): 450-472 (2011). Web SearchBibTeXDownload |
| 104 | A note on the expressive power of linear orders. Nicole Schweikardt, Thomas Schwentick. Logical Methods in Computer Science (7) (2011). Web SearchBibTeXDownload |
| 103 | Frontmatter, Table of Contents, Preface, Conference Organization. John P. Gallagher, Michael Gelfond. STACS 2011. Web SearchBibTeXDownload |
| 2010 |
|---|
| 102 | Inference of concise regular expressions and DTDs. Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren. ACM Trans. Database Syst. (35) (2010). Web SearchBibTeXDownload |
| 101 | Temporal Logics on Words with Multiple Data Values. Ahmet Kara, Thomas Schwentick, Thomas Zeume. CoRR (abs/1010.1139) (2010). Web SearchBibTeXDownload |
| 100 | Two-Variable Logic with Two Order Relations - (Extended Abstract). Thomas Schwentick, Thomas Zeume. CSL 2010, 499-513. Web SearchBibTeXDownload |
| 99 | The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. Thomas Eiter, Georg Gottlob, Thomas Schwentick. Fields of Logic and Computation 2010, 227-250. Web SearchBibTeXDownload |
| 98 | Logik und Automaten: ein echtes Dreamteam. Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick. Informatik Spektrum (33): 452-461 (2010). Web SearchBibTeXDownload |
| 97 | Complexity of hybrid logics over transitive frames. Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber. J. Applied Logic (8): 422-440 (2010). Web SearchBibTeXDownload |
| 96 | Schema design for XML repositories: complexity and tractability. Wim Martens, Matthias Niewerth, Thomas Schwentick. PODS 2010, 239-250. Web SearchBibTeXDownload |
| 95 | Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. Jean-Yves Marion, Thomas Schwentick. STACS 2010, 7-10. Web SearchBibTeXDownload |
| 94 | Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. Jean-Yves Marion, Thomas Schwentick. STACS 2010, 1-6. Web SearchBibTeXDownload |
| 93 | On notions of regularity for data languages. Henrik Björklund, Thomas Schwentick. Theor. Comput. Sci. (411): 702-715 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 92 | Tree Projections: Game Characterization and Computational Aspects. Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick. Graph Theory, Computational Intelligence and Thought 2009, 217-226. Web SearchBibTeXDownload |
| 91 | Two-variable logic on data trees and XML reasoning. Mikolaj Bojanczyk, Anca Muscholl, Anca Muscholl, Luc Segoufin, Luc Segoufin. J. ACM (56) (2009). Cited by 53Web SearchBibTeXDownload |
| 90 | Generalized hypertree decompositions: NP-hardness and tractable variants. Georg Gottlob, Zoltán Miklós, Thomas Schwentick. J. ACM (56) (2009). Web SearchBibTeXDownload |
| 89 | Volker Weber. Thomas Schwentick, Henrik Björklund. Journal of Logic, Language and Information (18): 433 (2009). Web SearchBibTeXDownload |
| 88 | On the Hybrid Extension of CTL and CTL+. Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick. MFCS 2009, 427-438. Web SearchBibTeXDownload |
| 87 | Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. Wim Martens, Frank Neven, Thomas Schwentick. SIAM J. Comput. (39): 1486-1530 (2009). Web SearchBibTeXDownload |
| 86 | The Dynamic Complexity of Formal Languages. Wouter Gelade, Marcel Marquardt, Thomas Schwentick. STACS 2009, 481-492. Web SearchBibTeXDownload |
| 2008 |
|---|
| 85 | Introduction to ICDT 2007 special section. Thomas Schwentick, Dan Suciu. ACM Trans. Database Syst. (33) (2008). Web SearchBibTeXDownload |
| 84 | Complexity of Hybrid Logics over Transitive Frames. Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber. CoRR (abs/0806.4130) (2008). Web SearchBibTeXDownload |
| 83 | Dynamic Complexity of Formal Languages. Wouter Gelade, Marcel Marquardt, Thomas Schwentick. CoRR (abs/0812.1915) (2008). Web SearchBibTeXDownload |
| 82 | Deterministic top-down tree automata: past, present, and future. Wim Martens, Frank Neven, Thomas Schwentick. Logic and Automata 2008, 505-530. Web SearchBibTeX |
| 81 | Counting in trees. Helmut Seidl, Thomas Schwentick, Anca Muscholl. Logic and Automata 2008, 575-612. Web SearchBibTeX |
| 80 | Optimizing Conjunctive Queries over Trees Using Schema Information. Henrik Björklund, Wim Martens, Thomas Schwentick. MFCS 2008, 132-143. Web SearchBibTeXDownload |
| 79 | A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). Thomas Schwentick. STACS 2008, 17-18. Web SearchBibTeXDownload |
| 2007 |
|---|
| 78 | Conjunctive Query Containment over Trees. Henrik Björklund, Wim Martens, Thomas Schwentick. DBPL 2007, 66-80. Web SearchBibTeXDownload |
| 77 | On Notions of Regularity for Data Languages. Henrik Björklund, Thomas Schwentick. FCT 2007, 88-99. Web SearchBibTeXDownload |
| 76 | Automata for XML - A survey. Thomas Schwentick. J. Comput. Syst. Sci. (73): 289-315 (2007). Web SearchBibTeXDownload |
| 75 | The complexity of reasoning about pattern-based XML schemas. Gjergji Kasneci, Thomas Schwentick. PODS 2007, 155-164. Web SearchBibTeXDownload |
| 74 | Generalized hypertree decompositions: np-hardness and tractable variants. Georg Gottlob, Zoltán Miklós, Thomas Schwentick. PODS 2007, 13-22. Web SearchBibTeXDownload |
| 73 | Simple off the shelf abstractions for XML schema. Wim Martens, Frank Neven, Thomas Schwentick. SIGMOD Record (36): 15-22 (2007). Cited by 5Web SearchBibTeXDownload |
| 72 | Bounded-Variable Fragments of Hybrid Logics. Thomas Schwentick, Volker Weber. STACS 2007, 561-572. Web SearchBibTeXDownload |
| 71 | Dynamic Complexity Theory Revisited. Volker Weber, Thomas Schwentick. Theory Comput. Syst. (40): 355-377 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 70 | Expressiveness and complexity of XML Schema. Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex. ACM Trans. Database Syst. (31): 770-813 (2006). Cited by 57Web SearchBibTeXDownload |
| 69 | 06451 Executive Summary -- Circuits, Logic, and Games . Thomas Schwentick, Denis Thérien, Heribert Vollmer. Circuits, Logic, and Games 2006. Web SearchBibTeXDownload |
| 68 | 06451 Abstracts Collection -- Circuits, Logic, and Games . Thomas Schwentick, Denis Thérien, Heribert Vollmer. Circuits, Logic, and Games 2006. Web SearchBibTeXDownload |
| 67 | Expressive Power of Pebble Automata. Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin. ICALP (1) 2006, 157-168. Cited by 21Web SearchBibTeXDownload |
| 66 | The many faces of a translation. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. J. Comput. Syst. Sci. (72): 163-179 (2006). Web SearchBibTeXDownload |
| 65 | Two-Variable Logic on Words with Data. Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David. LICS 2006, 7-16. Cited by 67Web SearchBibTeXDownload |
| 64 | On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Frank Neven, Thomas Schwentick. Logical Methods in Computer Science (2) (2006). Cited by 27Web SearchBibTeXDownload |
| 63 | Two-variable logic on data trees and XML reasoning. Mikolaj Bojanczyk, Anca Muscholl, Anca Muscholl, Luc Segoufin, Luc Segoufin. PODS 2006, 10-19. Cited by 53Web SearchBibTeXDownload |
| 62 | Active Context-Free Games. Anca Muscholl, Thomas Schwentick, Luc Segoufin. Theory Comput. Syst. (39): 237-276 (2006). Cited by 18Web SearchBibTeXDownload |
| 61 | Inference of Concise DTDs from XML Data. Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls. VLDB 2006, 115-126. Cited by 52Web SearchBibTeXDownload |
| 2005 |
|---|
| 60 | On the Complexity of Equational Horn Clauses. Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick. CADE 2005, 337-352. Web SearchBibTeXDownload |
| 59 | 05061 Abstracts Collection - Foundations of Semistructured Data. Frank Neven, Thomas Schwentick, Dan Suciu. Foundations of Semistructured Data 2005. Web SearchBibTeXDownload |
| 58 | 05061 Summary - Foundations of Semi-structured Data. Frank Neven, Thomas Schwentick, Dan Suciu. Foundations of Semistructured Data 2005. Web SearchBibTeXDownload |
| 57 | Which XML Schemas Admit 1-Pass Preorder Typing?. Wim Martens, Frank Neven, Thomas Schwentick. ICDT 2005, 68-82. Cited by 25Web SearchBibTeXDownload |
| 56 | Dynamic Complexity Theory Revisited. Volker Weber, Thomas Schwentick. STACS 2005, 256-268. Web SearchBibTeXDownload |
| 55 | Expressiveness of XSDs: from practice to theory, there and back again. Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick. WWW 2005, 712-721. Web SearchBibTeXDownload |
| 2004 |
|---|
| 54 | Finite state machines for strings over infinite alphabets. Frank Neven, Thomas Schwentick, Victor Vianu. ACM Trans. Comput. Log. (5): 403-435 (2004). Cited by 61Web SearchBibTeXDownload |
| 53 | Counting in Trees for Free. Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl. ICALP 2004, 1136-1149. Web SearchBibTeXDownload |
| 52 | Existential second-order logic over graphs: Charting the tractability frontier. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. J. ACM (51): 312-362 (2004). Web SearchBibTeXDownload |
| 51 | Complexity of Decision Problems for Simple Regular Expressions. Wim Martens, Frank Neven, Thomas Schwentick. MFCS 2004, 889-900. Cited by 43Web SearchBibTeXDownload |
| 50 | Trees, Automata and XML. Thomas Schwentick. PODS 2004, 222. Web SearchBibTeXDownload |
| 49 | Solving Equations in the Relational Algebra. Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche. SIAM J. Comput. (33): 1052-1066 (2004). Web SearchBibTeXDownload |
| 48 | XPath query containment. Thomas Schwentick. SIGMOD Record (33): 101-109 (2004). Web SearchBibTeXDownload |
| 47 | Active Context-Free Games. Anca Muscholl, Thomas Schwentick, Luc Segoufin. STACS 2004, 452-464. Cited by 18Web SearchBibTeXDownload |
| 2003 |
|---|
| 46 | XPath Containment in the Presence of Disjunction, DTDs, and Variables. Frank Neven, Thomas Schwentick. ICDT 2003, 312-326. Cited by 180Web SearchBibTeXDownload |
| 45 | On the power of tree-walking automata. Frank Neven, Thomas Schwentick. Inf. Comput. (183): 86-103 (2003). Cited by 41Web SearchBibTeXDownload |
| 44 | Definable relations and first-order query languages over strings. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. J. ACM (50): 694-751 (2003). Cited by 23Web SearchBibTeXDownload |
| 43 | XML: Model, Schemas, Types, Logics, and Queries. Nils Klarlund, Thomas Schwentick, Dan Suciu. Logics for Emerging Applications of Databases 2003, 1-41. Cited by 29Web SearchBibTeX |
| 42 | Numerical document queries. Helmut Seidl, Thomas Schwentick, Anca Muscholl. PODS 2003, 155-166. Web SearchBibTeXDownload |
| 2002 |
|---|
| 41 | Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. Etienne Grandjean, Thomas Schwentick. SIAM J. Comput. (32): 196-230 (2002). Web SearchBibTeXDownload |
| 40 | Query automata over finite trees. Frank Neven, Thomas Schwentick. Theor. Comput. Sci. (275): 633-674 (2002). Cited by 140Web SearchBibTeXDownload |
| 2001 |
|---|
| 39 | Solving equations in the relational algebra. Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche. CoRR (cs.LO/0106034) (2001). Web SearchBibTeXDownload |
| 38 | Partially-Ordered Two-Way Automata: A New Characterization of DA. Thomas Schwentick, Denis Thérien, Heribert Vollmer. Developments in Language Theory 2001, 239-250. Web SearchBibTeXDownload |
| 37 | Second-Order Logic over Strings: Regular and Non-regular Fragments. Thomas Eiter, Georg Gottlob, Thomas Schwentick. Developments in Language Theory 2001, 37-56. Web SearchBibTeXDownload |
| 36 | The Descriptive Complexity Approach to LOGCFL. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. J. Comput. Syst. Sci. (62): 629-652 (2001). Web SearchBibTeXDownload |
| 35 | A Model-Theoretic Approach to Regular String Relations. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. LICS 2001, 431-440. Cited by 21Web SearchBibTeXDownload |
| 34 | Towards Regular Languages over Infinite Alphabets. Frank Neven, Thomas Schwentick, Victor Vianu. MFCS 2001, 560-572. Cited by 31Web SearchBibTeXDownload |
| 33 | String Operations in Query Languages. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. PODS 2001. Cited by 12Web SearchBibTeXDownload |
| 32 | Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Frank Neven, Thomas Schwentick. Semantics in Databases 2001, 160-178. Cited by 19Web SearchBibTeXDownload |
| 31 | When is the evaluation of conjunctive queries tractable?. Martin Grohe, Thomas Schwentick, Luc Segoufin. STOC 2001, 657-666. Cited by 50Web SearchBibTeXDownload |
| 2000 |
|---|
| 30 | Locality of order-invariant first-order formulas. Martin Grohe, Thomas Schwentick. ACM Trans. Comput. Log. (1): 112-130 (2000). Web SearchBibTeXDownload |
| 29 | Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. FOCS 2000, 664-674. Web SearchBibTeXDownload |
| 28 | Logically defined queries on trees. Thomas Schwentick. Grundlagen von Datenbanken 2000, 96-100. Web SearchBibTeXDownload |
| 27 | On the Power of Tree-Walking Automata. Frank Neven, Thomas Schwentick. ICALP 2000, 547-560. Web SearchBibTeXDownload |
| 26 | The Many Faces of a Translation. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. ICALP 2000, 890-901. Web SearchBibTeXDownload |
| 25 | On Diving in Trees. Thomas Schwentick. MFCS 2000, 660-669. Web SearchBibTeXDownload |
| 24 | Expressive and Efficient Pattern Languages for Tree-Structured Data. Frank Neven, Thomas Schwentick. PODS 2000, 145-156. Cited by 78Web SearchBibTeX |
| 1999 |
|---|
| 23 | Local Normal Forms for First-Order Logic with Applications to Games and Automata. Thomas Schwentick, Klaus Barthelmann. Discrete Mathematics & Theoretical Computer Science (3): 109-124 (1999). Web SearchBibTeXDownload |
| 22 | Automata for Unary Queries on Trees. Frank Neven, Thomas Schwentick. Grundlagen von Datenbanken 1999, 102-106. Web SearchBibTeX |
| 21 | Query Automata. Frank Neven, Thomas Schwentick. PODS 1999, 205-214. Web SearchBibTeX |
| 20 | The Descriptive Complexity Approach to LOGCFL. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. STACS 1999, 444-454. Web SearchBibTeXDownload |
| 19 | A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick. STACS 1999, 143-152. Web SearchBibTeXDownload |
| 1998 |
|---|
| 18 | The descriptive complexity approach to LOGCFL. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. CoRR (cs.CC/9809114) (1998). Web SearchBibTeXDownload |
| 17 | Descriptive Complexity, Lower Bounds and Linear Time. Thomas Schwentick. CSL 1998, 9-28. Web SearchBibTeXDownload |
| 16 | The Descriptive Complexity Approach to LOGCFL. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload |
| 15 | Positive Versions of Polynomial Time. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart. Inf. Comput. (147): 145-170 (1998). Web SearchBibTeXDownload |
| 14 | Subclasses of Binary NP. Arnaud Durand, Clemens Lautemann, Thomas Schwentick. J. Log. Comput. (8): 189-207 (1998). Web SearchBibTeXDownload |
| 13 | Locality of Order-Invariant First-Order Formulas. Martin Grohe, Thomas Schwentick. MFCS 1998, 437-445. Web SearchBibTeXDownload |
| 12 | Local Normal Forms for First-Order Logic with Applications to Games and Automata. Thomas Schwentick, Klaus Barthelmann. STACS 1998, 444-454. Web SearchBibTeXDownload |
| 1997 |
|---|
| 11 | Padding and the Expressive Power of Existential Second-Order Logics. Thomas Schwentick. CSL 1997, 461-477. Web SearchBibTeXDownload |
| 10 | Algebraic and Logical Characterizations of Deterministic Linear Time Classes. Thomas Schwentick. STACS 1997, 463-474. Web SearchBibTeXDownload |
| 1996 |
|---|
| 9 | On Winning Ehrenfeucht Games and Monadic NP. Thomas Schwentick. Ann. Pure Appl. Logic (79): 61-92 (1996). Web SearchBibTeXDownload |
| 8 | On Positive P. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart. IEEE Conference on Computational Complexity 1996, 162-170. Web SearchBibTeXDownload |
| 7 | On Bijections vs. Unary Functions. Thomas Schwentick. STACS 1996, 415-426. Web SearchBibTeXDownload |
| 1995 |
|---|
| 6 | Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. Thomas Schwentick. ICALP 1995, 405-416. Web SearchBibTeXDownload |
| 5 | The Power of the Middle Bit of a #P Function. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán. J. Comput. Syst. Sci. (50): 456-467 (1995). Cited by 30Web SearchBibTeXDownload |
| 1994 |
|---|
| 4 | Logics For Context-Free Languages. Clemens Lautemann, Thomas Schwentick, Denis Thérien. CSL 1994, 205-216. Web SearchBibTeXDownload |
| 3 | Graph Connectivity and Monadic NP. Thomas Schwentick. FOCS 1994, 614-622. Web SearchBibTeXDownload |
| 1993 |
|---|
| 2 | On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner. Structure in Complexity Theory Conference 1993, 200-207. Web SearchBibTeX |
| 1992 |
|---|
| 1 | On the Power of Polynomial Bit-Reductions. Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner. Universität Trier, Mathematik/Informatik, Forschungsbericht (92-28) (1992). Web SearchBibTeX |
