H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 39 Citations 5,664 102 World Ranking 4779 National Ranking 218

Research.com Recognitions

Awards & Achievements

2013 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algebra
  • Algorithm

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 most cited work include:

  • Finite state machines for strings over infinite alphabets (229 citations)
  • XPath Containment in the Presence of Disjunction, DTDs, and Variables (193 citations)
  • Two-Variable Logic on Words with Data (175 citations)

What are the main themes of his work throughout his whole career to date?

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

  • Hypercube most often made with reference to Correctness,
  • Containment that intertwine with fields like XPath.

He most often published in these fields:

  • Discrete mathematics (36.36%)
  • Theoretical computer science (35.89%)
  • Programming language (16.75%)

What were the highlights of his more recent work (between 2015-2021)?

  • Theoretical computer science (35.89%)
  • Conjunctive query (12.44%)
  • Discrete mathematics (36.36%)

In recent papers he was focusing on the following fields of study:

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.

Between 2015 and 2021, his most popular works were:

  • Dynamic complexity: recent updates (15 citations)
  • Research Directions for Principles of Data Management (Abridged) (14 citations)
  • Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151) (14 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algebra
  • Algorithm

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.

Top Publications

Finite state machines for strings over infinite alphabets

Frank Neven;Thomas Schwentick;Victor Vianu.
ACM Transactions on Computational Logic (2004)

304 Citations

Two-variable logic on data trees and XML reasoning

Mikoaj Bojańczyk;Anca Muscholl;Thomas Schwentick;Luc Segoufin.
Journal of the ACM (2009)

252 Citations

XPath Containment in the Presence of Disjunction, DTDs, and Variables

Frank Neven;Thomas Schwentick.
international conference on database theory (2003)

244 Citations

Two-Variable Logic on Words with Data

M. Bojanczyk;A. Muscholl;T. Schwentick;Luc Segoufin.
logic in computer science (2006)

237 Citations

Expressiveness and complexity of XML Schema

Wim Martens;Frank Neven;Thomas Schwentick;Geert Jan Bex.
ACM Transactions on Database Systems (2006)

209 Citations

When is the evaluation of conjunctive queries tractable

Martin Grohe;Thomas Schwentick;Luc Segoufin.
symposium on the theory of computing (2001)

208 Citations

Two-variable logic on data words

Mikołaj Bojańczyk;Claire David;Anca Muscholl;Thomas Schwentick.
ACM Transactions on Computational Logic (2011)

184 Citations

Automata for XML---A survey

Thomas Schwentick.
Journal of Computer and System Sciences (2007)

173 Citations

Inference of concise DTDs from XML data

Geert Jan Bex;Frank Neven;Thomas Schwentick;Karl Tuyls.
very large data bases (2006)

164 Citations

Query automata over finite trees

Frank Neven;Thomas Schwentick.
Theoretical Computer Science (2002)

163 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Thomas Schwentick

Leonid Libkin

Leonid Libkin

University of Edinburgh

Publications: 79

Georg Gottlob

Georg Gottlob

University of Oxford

Publications: 59

Frank Neven

Frank Neven

Hasselt University

Publications: 44

Michael Zakharyaschev

Michael Zakharyaschev

Birkbeck, University of London

Publications: 26

Michael Benedikt

Michael Benedikt

University of Oxford

Publications: 24

Victor Vianu

Victor Vianu

University of California, San Diego

Publications: 22

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 22

Diego Calvanese

Diego Calvanese

Free University of Bozen-Bolzano

Publications: 21

Martin Grohe

Martin Grohe

RWTH Aachen University

Publications: 19

Christoph Koch

Christoph Koch

École Polytechnique Fédérale de Lausanne

Publications: 19

Wenfei Fan

Wenfei Fan

University of Edinburgh

Publications: 18

Serge Abiteboul

Serge Abiteboul

French Institute for Research in Computer Science and Automation - INRIA

Publications: 15

maarten marx

maarten marx

University of Amsterdam

Publications: 15

Nicola Leone

Nicola Leone

University of Calabria

Publications: 14

Alin Deutsch

Alin Deutsch

University of California, San Diego

Publications: 14

Something went wrong. Please try again later.