Thomas Schwentick
Thomas Schwentick
Professor of Computer Science, TU Dortmund University
Verified email at udo.edu
Title
Cited by
Cited by
Year
Texts in Theoretical Computer Science An EATCS Series
ACDHJ Hartmanis, T Henzinger, JHNJT Leighton, M Nivat
26512006
Finite state machines for strings over infinite alphabets
F Neven, T Schwentick, V Vianu
ACM Transactions on Computational Logic (TOCL) 5 (3), 403-435, 2004
3042004
Two-variable logic on data trees and XML reasoning
M Bojańczyk, A Muscholl, T Schwentick, L Segoufin
Journal of the ACM (JACM) 56 (3), 1-48, 2009
2532009
XPath containment in the presence of disjunction, DTDs, and variables
F Neven, T Schwentick
International Conference on Database Theory, 315-329, 2003
2452003
Two-variable logic on words with data
M Bojanczyk, A Muscholl, T Schwentick, L Segoufin, C David
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 7-16, 2006
2192006
Expressiveness and complexity of XML Schema
W Martens, F Neven, T Schwentick, GJ Bex
ACM Transactions on Database Systems (TODS) 31 (3), 770-813, 2006
2092006
Two-variable logic on data words
M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin
ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011
1872011
Automata for XML—a survey
T Schwentick
Journal of Computer and System Sciences 73 (3), 289-315, 2007
1692007
Inference of concise DTDs from XML data
GJ Bex, F Neven, T Schwentick, K Tuyls
Proceedings of the 32nd international conference on Very large data basesá…, 2006
1622006
Query automata over finite trees
F Neven, T Schwentick
Theoretical Computer Science 275 (1-2), 633-674, 2002
1582002
XPath query containment
T Schwentick
ACM SIGMOD Record 33 (1), 101-109, 2004
1572004
When is the evaluation of conjunctive queries tractable?
M Grohe, T Schwentick, L Segoufin
Proceedings of the thirty-third annual ACM symposium on Theory of computingá…, 2001
1572001
Expressive and efficient pattern languages for tree-structured data
F Neven, T Schwentick
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium oná…, 2000
1432000
On the power of polynomial time bit-reductions
U Hertrampf, C Lautemann, T Schwentick, H Vollmer, KW Wagner
[1993] Proceedings of the Eigth Annual Structure in Complexity Theoryá…, 1993
1281993
On the complexity of equational horn clauses
KN Verma, H Seidl, T Schwentick
International Conference on Automated Deduction, 337-352, 2005
1172005
Inference of concise regular expressions and DTDs
GJ Bex, F Neven, T Schwentick, S Vansummeren
ACM Transactions on Database Systems (TODS) 35 (2), 1-47, 2010
1152010
Generalized hypertree decompositions: NP-hardness and tractable variants
G Gottlob, Z Miklˇs, T Schwentick
Journal of the ACM (JACM) 56 (6), 1-32, 2009
1142009
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004
1122004
On notions of regularity for data languages
H Bj÷rklund, T Schwentick
Theoretical Computer Science 411 (4-5), 702-715, 2010
1112010
Competitor analysis and its defenses in the e-marketplace
YP Sheng, PP Mykytyn Jr, CR Litecky
Communications of the ACM 48 (8), 107-112, 2005
104*2005
The system can't perform the operation now. Try again later.
Articles 1–20