| 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 | 346 | 2004 |
| 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 | 262 | 2009 |
| XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Database TheoryICDT 2003: 9th International Conference Siena, Italy
, 2002 | 251 | 2002 |
| 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 | 249 | 2006 |
| 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 | 218 | 2006 |
| 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 | 211 | 2011 |
| Automata for XMLa survey T Schwentick Journal of Computer and System Sciences 73 (3), 289-315, 2007 | 181 | 2007 |
| Inference of concise DTDs from XML data GJ Bex, F Neven, T Schwentick, K Tuyls ACM Press, 2006 | 175 | 2006 |
| 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 | 170 | 2001 |
| Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002 | 163 | 2002 |
| XPath query containment T Schwentick ACM SIGMOD Record 33 (1), 101-109, 2004 | 162 | 2004 |
| Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on
, 2000 | 152 | 2000 |
| 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 | 136 | 1993 |
| On the complexity of equational horn clauses KN Verma, H Seidl, T Schwentick Automated DeductionCADE-20: 20th International Conference on Automated
, 2005 | 133 | 2005 |
| 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 | 128 | 2010 |
| 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 | 128 | 2009 |
| On notions of regularity for data languages H Björklund, T Schwentick Theoretical Computer Science 411 (4-5), 702-715, 2010 | 120 | 2010 |
| Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl Automata, Languages and Programming: 31st International Colloquium, ICALP
, 2004 | 114 | 2004 |
| On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick arXiv preprint cs/0606065, 2006 | 106 | 2006 |
| The price of query rewriting in ontology-based data access G Gottlob, S Kikot, R Kontchakov, V Podolskii, T Schwentick, ... Artificial Intelligence 213, 42-59, 2014 | 103 | 2014 |
