Thomas Schwentick

2007
79		Thomas Schwentick, Dan Suciu: Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings Springer 2007
78	EE	Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive Query Containment over Trees. DBPL 2007: 66-80
77	EE	Henrik Björklund, Thomas Schwentick: On Notions of Regularity for Data Languages. FCT 2007: 88-99
76	EE	Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: np-hardness and tractable variants. PODS 2007: 13-22
75	EE	Gjergji Kasneci, Thomas Schwentick: The complexity of reasoning about pattern-based XML schemas. PODS 2007: 155-164
74	EE	Thomas Schwentick, Volker Weber: Bounded-Variable Fragments of Hybrid Logics. STACS 2007: 561-572
73	EE	Thomas Schwentick: Automata for XML - A survey. J. Comput. Syst. Sci. 73(3): 289-315 (2007)
72	EE	Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)
71	EE	Volker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007)
2006
70	EE	Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168
69	EE	Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16
68	EE	Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19
67	EE	Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126
66	EE	Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)
65	EE	Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables CoRR abs/cs/0606065: (2006)
64	EE	Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)
63	EE	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)
62	EE	Anca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006)
2005
61		Frank Neven, Thomas Schwentick, Dan Suciu: Foundations of Semistructured Data, 6.-11. February 2005 IBFI, Schloss Dagstuhl, Germany 2005
60	EE	Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
59	EE	Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005
58	EE	Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005
57	EE	Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82
56	EE	Volker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. STACS 2005: 256-268
55	EE	Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721
2004
54	EE	Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149
53	EE	Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900
52	EE	Thomas Schwentick: Trees, Automata and XML. PODS 2004: 222
51	EE	Anca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. STACS 2004: 452-464
50	EE	Frank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)
49	EE	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)
48	EE	Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004)
47	EE	Thomas Schwentick: XPath query containment. SIGMOD Record 33(1): 101-109 (2004)
2003
46	EE	Frank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326
45		Nils Klarlund, Thomas Schwentick, Dan Suciu: XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41
44	EE	Helmut Seidl, Thomas Schwentick, Anca Muscholl: Numerical document queries. PODS 2003: 155-166
43	EE	Frank Neven, Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003)
42	EE	Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003)
2002
41	EE	Etienne Grandjean, Thomas Schwentick: Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32(1): 196-230 (2002)
40	EE	Frank Neven, Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)
2001
39	EE	Thomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250
38	EE	Thomas Eiter, Georg Gottlob, Thomas Schwentick: Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56
37		Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-
36	EE	Frank Neven, Thomas Schwentick, Victor Vianu: Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572
35	EE	Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: String Operations in Query Languages. PODS 2001
34	EE	Martin Grohe, Thomas Schwentick, Luc Segoufin: When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666
33	EE	Frank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178
32	EE	Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving equations in the relational algebra CoRR cs.LO/0106034: (2001)
31		Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)
2000
30		Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674
29	EE	Thomas Schwentick: Logically defined queries on trees. Grundlagen von Datenbanken 2000: 96-100
28	EE	Frank Neven, Thomas Schwentick: On the Power of Tree-Walking Automata. ICALP 2000: 547-560
27	EE	Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901
26	EE	Thomas Schwentick: On Diving in Trees. MFCS 2000: 660-669
25	EE	Frank Neven, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156
24	EE	Martin Grohe, Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): 112-130 (2000)
1999
23		Frank Neven, Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106
22	EE	Frank Neven, Thomas Schwentick: Query Automata. PODS 1999: 205-214
21	EE	Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152
20	EE	Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454
19	EE	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)
1998
18		Thomas Schwentick: Descriptive Complexity, Lower Bounds and Linear Time. CSL 1998: 9-28
17	EE	Martin Grohe, Thomas Schwentick: Locality of Order-Invariant First-Order Formulas. MFCS 1998: 437-445
16		Thomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998: 444-454
15	EE	Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL CoRR cs.CC/9809114: (1998)
14	EE	Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998)
13		Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998)
12		Arnaud Durand, Clemens Lautemann, Thomas Schwentick: Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998)
1997
11		Thomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics. CSL 1997: 461-477
10		Thomas Schwentick: Algebraic and Logical Characterizations of Deterministic Linear Time Classes. STACS 1997: 463-474
1996
9	EE	Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: On Positive P. IEEE Conference on Computational Complexity 1996: 162-170
8		Thomas Schwentick: On Bijections vs. Unary Functions. STACS 1996: 415-426
7		Thomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79(1): 61-92 (1996)
1995
6		Thomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995: 405-416
5		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)
1994
4		Clemens Lautemann, Thomas Schwentick, Denis Thérien: Logics For Context-Free Languages. CSL 1994: 205-216
3		Thomas Schwentick: Graph Connectivity and Monadic NP FOCS 1994: 614-622
1993
2		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
1		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

1	Klaus Barthelmann	[16] [19]
2	Michael Benedikt	[35] [37] [42]
3	Geert Jan Bex	[55] [66] [67]
4	Joachim Biskup	[32] [48]
5	Henrik Björklund	[77] [78]
6	Mikolaj Bojanczyk	[68] [69] [70]
7	Jan Van den Bussche	[32] [48]
8	Claire David	[68] [69]
9	Arnaud Durand	[12]
10	Thomas Eiter	[38]
11	Georg Gottlob	[30] [38] [49] [76]
12	Etienne Grandjean	[41]
13	Frederic Green	[5]
14	Martin Grohe	[17] [24] [34]
15	Peter Habermehl	[54]
16	Ulrich Hertrampf	[1] [2]
17	Gjergji Kasneci	[75]
18	Nils Klarlund	[45]
19	Johannes Köbler	[5]
20	Phokion G. Kolaitis	[30] [49]
21	Clemens Lautemann	[1] [2] [4] [9] [12] [13] [14] [15] [20] [21] [31]
22	Leonid Libkin	[35] [37] [42]
23	Wim Martens	[53] [55] [57] [66] [72] [78]
24	Pierre McKenzie	[14] [15] [20] [27] [31] [64]
25	Zoltán Miklós	[76]
26	Anca Muscholl	[44] [51] [54] [62] [68] [69]
27	Frank Neven	[22] [23] [25] [28] [33] [36] [40] [43] [46] [50] [53] [55] [57] [58] [59] [61] [63] [65] [66] [67] [72]
28	Jan Paredaens	[32] [48]
29	Kenneth W. Regan	[5]
30	Mathias Samuelides	[70]
31	Nicole Schweikardt	[21]
32	Luc Segoufin	[34] [35] [37] [42] [51] [62] [68] [69] [70]
33	Helmut Seidl	[44] [54] [60]
34	Iain A. Stewart	[9] [13]
35	Dan Suciu	[45] [58] [59] [61] [79]
36	Denis Thérien	[4] [27] [39] [64]
37	Jacobo Torán	[5]
38	Karl Tuyls	[67]
39	Kumar Neeraj Verma	[60]
40	Victor Vianu	[36] [50]
41	Heribert Vollmer	[1] [2] [14] [15] [20] [27] [31] [39] [64]
42	Klaus W. Wagner	[1] [2]
43	Volker Weber	[56] [71] [74]

Colors in the list of coauthors