2013 - Member of Academia Europaea
Thomas Schwentick spends much of his time researching Discrete mathematics, Theoretical computer science, Programming language, Automaton and Satisfiability. He interconnects Context-free language, Conjunctive query, Tree automaton and Combinatorics in the investigation of issues within Discrete mathematics. His studies in Theoretical computer science integrate themes in fields like Ontology language, XML Schema Editor, Unary operation, Finite-state machine and XML schema.
The study incorporates disciplines such as XML validation and XPath in addition to Programming language. The concepts of his Automaton study are interwoven with issues in Set and Document Structure Description. His study in Satisfiability is interdisciplinary in nature, drawing from both Fragment and Decidability.
His primary areas of investigation include Discrete mathematics, Theoretical computer science, Programming language, Combinatorics and Conjunctive query. His Discrete mathematics study incorporates themes from Regular language and Tree automaton. His research integrates issues of String and Formal language in his study of Theoretical computer science.
His work deals with themes such as XML validation, XML and Nested word, which intersect with Programming language. The Combinatorics study combines topics in areas such as Computational complexity theory and Order. His Conjunctive query research also works with subjects such as
His primary areas of study are Theoretical computer science, Conjunctive query, Discrete mathematics, Data management and Reachability. His Theoretical computer science study combines topics in areas such as Symbol, Server, Descriptive complexity theory and Formal language. His studies deal with areas such as Decidability, Automaton and Extension as well as Symbol.
His Conjunctive query research incorporates elements of Semantics and Negation. He conducts interdisciplinary study in the fields of Discrete mathematics and Bounded function through his research. His Reachability study integrates concerns from other disciplines, such as Directed acyclic graph and Information retrieval.
Thomas Schwentick mainly focuses on Theoretical computer science, Data management, Conjunctive query, Server and Discrete mathematics. His Data management research is multidisciplinary, relying on both World Wide Web, Subject and Management science. The various areas that Thomas Schwentick examines in his Conjunctive query study include Correctness and Negation.
Thomas Schwentick has included themes like Hypercube, Distributed database and Distribution in his Correctness study. His Negation research incorporates themes from Semantics, Join, Containment and Existential quantification. In his research, Thomas Schwentick performs multidisciplinary study on Discrete mathematics and Bounded function.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Finite state machines for strings over infinite alphabets
Frank Neven;Thomas Schwentick;Victor Vianu.
ACM Transactions on Computational Logic (2004)
Two-variable logic on data trees and XML reasoning
Mikoaj Bojańczyk;Anca Muscholl;Thomas Schwentick;Luc Segoufin.
Journal of the ACM (2009)
XPath Containment in the Presence of Disjunction, DTDs, and Variables
Frank Neven;Thomas Schwentick.
international conference on database theory (2003)
Two-Variable Logic on Words with Data
M. Bojanczyk;A. Muscholl;T. Schwentick;Luc Segoufin.
logic in computer science (2006)
When is the evaluation of conjunctive queries tractable
Martin Grohe;Thomas Schwentick;Luc Segoufin.
symposium on the theory of computing (2001)
Expressiveness and complexity of XML Schema
Wim Martens;Frank Neven;Thomas Schwentick;Geert Jan Bex.
ACM Transactions on Database Systems (2006)
Two-variable logic on data words
Mikołaj Bojańczyk;Claire David;Anca Muscholl;Thomas Schwentick.
ACM Transactions on Computational Logic (2011)
Automata for XML---A survey
Journal of Computer and System Sciences (2007)
Inference of concise DTDs from XML data
Geert Jan Bex;Frank Neven;Thomas Schwentick;Karl Tuyls.
very large data bases (2006)
Query automata over finite trees
Frank Neven;Thomas Schwentick.
Theoretical Computer Science (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: