BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Austria
1 × China
1 × Denmark
1 × Estonia
1 × Finland
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × Japan
1 × Korea
1 × Switzerland
2 × Czech Republic
2 × Italy
2 × Spain
8 × USA
Collaborated with:
F.Neven L.Segoufin T.Zeume G.Gottlob A.Muscholl H.Seidl W.Martens M.Niewerth M.Bojanczyk D.Thérien H.Vollmer N.Vortmeier A.Kara G.Kasneci M.Benedikt L.Libkin D.Kozen C.David T.Tan Z.Miklós K.N.Verma T.Eiter M.Grohe M.Samuelides G.J.Bex K.Tuyls P.Habermehl P.McKenzie S.Datta R.Kulkarni A.Mukherjee T.J.Ameloot G.Geck B.Ketsman B.Bollig A.Cyriac L.Hélouët J.Schmidt I.Kokkinis
Talks about:
automata (8) logic (7) xml (7) queri (6) two (6) complex (5) tree (5) data (5) variabl (4) express (4)

Person: Thomas Schwentick

DBLP DBLP: Schwentick:Thomas

Facilitated 1 volumes:

PODS 2011Ed

Contributed to:

CSL 20152015
ICALP (2) 20152015
PODS 20152015
LATA 20132013
KR 20122012
LATA 20122012
VLDB 20122012
CSL 20102010
PODS 20102010
PODS 20072007
ICALP (1) 20062006
LICS 20062006
PODS 20062006
VLDB 20062006
CADE 20052005
ICALP 20042004
PODS 20042004
PODS 20032003
DLT 20012001
LICS 20012001
PODS 20012001
STOC 20012001
ICALP 20002000
PODS 20002000
PODS 19991999
CSL 19981998
CSL 19971997
ICALP 19951995
CSL 20182018
CSL 20202020

Wrote 35 papers:

CSL-2015-SchwentickVZ #source code #static analysis
Static Analysis for Logic-based Dynamic Programs (TS, NV, TZ), pp. 308–324.
ICALP-v2-2015-DattaKMSZ #reachability
Reachability is in DynFO (SD, RK, AM, TS, TZ), pp. 159–170.
PODS-2015-AmelootGKNS #query
Parallel-Correctness and Transferability for Conjunctive Queries (TJA, GG, BK, FN, TS), pp. 47–58.
PODS-2015-MartensNNS #named #xml
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema (WM, FN, MN, TS), pp. 145–156.
LATA-2013-BolligCHKS #automaton #branch #communication
Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.
LATA-2013-Schwentick #automaton #challenge #xml
XML Schema Management: A Challenge for Automata Theory (TS), p. 43.
KR-2012-GottlobS #datalog #ontology #query #recursion #source code
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
LATA-2012-KaraST #automaton #logic #word
Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.
Developing and Analyzing XSDs through BonXai (WM, FN, MN, TS), pp. 1994–1997.
CSL-2010-SchwentickZ #logic #order
Two-Variable Logic with Two Order Relations — (TS, TZ), pp. 499–513.
PODS-2010-MartensNS #complexity #design #repository #xml
Schema design for XML repositories: complexity and tractability (WM, MN, TS), pp. 239–250.
PODS-2007-GottlobMS #np-hard
Generalized hypertree decompositions: np-hardness and tractable variants (GG, ZM, TS), pp. 13–22.
PODS-2007-KasneciS #complexity #reasoning #xml
The complexity of reasoning about pattern-based XML schemas (GK, TS), pp. 155–164.
ICALP-v1-2006-BojanczykSSS #automaton #power of
Expressive Power of Pebble Automata (MB, MS, TS, LS), pp. 157–168.
LICS-2006-BojanczykMSSD #logic #word
Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.
PODS-2006-BojanczykDMSS #logic #reasoning #xml
Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
VLDB-2006-BexNST #xml
Inference of Concise DTDs from XML Data (GJB, FN, TS, KT), pp. 115–126.
CADE-2005-VermaSS #complexity #equation #horn clause #on the
On the Complexity of Equational Horn Clauses (KNV, HS, TS), pp. 337–352.
ICALP-2004-SeidlSMH #for free
Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
PODS-2004-Schwentick #automaton #xml
Trees, Automata and XML (TS), p. 222.
PODS-2003-SeidlSM #documentation #query
Numerical document queries (HS, TS, AM), pp. 155–166.
DLT-2001-EiterGS #higher-order #logic #string
Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.
DLT-2001-SchwentickTV #automaton
Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
LICS-2001-BenediktLSS #approach #string
A Model-Theoretic Approach to Regular String Relations (MB, LL, TS, LS), pp. 431–440.
PODS-2001-BenediktLSS #query #string
String Operations in Query Languages (MB, LL, TS, LS).
STOC-2001-GroheSS #evaluation #query #question
When is the evaluation of conjunctive queries tractable? (MG, TS, LS), pp. 657–666.
The Many Faces of a Translation (PM, TS, DT, HV), pp. 890–901.
ICALP-2000-NevenS #automaton #on the #power of
On the Power of Tree-Walking Automata (FN, TS), pp. 547–560.
PODS-2000-NevenS #pattern matching #performance
Expressive and Efficient Pattern Languages for Tree-Structured Data (FN, TS), pp. 145–156.
PODS-1999-NevenS #automaton #query
Query Automata (FN, TS), pp. 205–214.
CSL-1998-Schwentick #bound #complexity #linear
Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.
CSL-1997-Schwentick #higher-order #logic #power of
Padding and the Expressive Power of Existential Second-Order Logics (TS), pp. 461–477.
ICALP-1995-Schwentick #graph #monad
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.
The Ackermann Award 2018 (DK, TS), p. 5.
CSL-2020-SchmidtSVZK #algorithm #complexity
Dynamic Complexity Meets Parameterised Algorithms (JS, TS, NV, TZ, IK), p. 17.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.