World's Best Scientists 2026 revealed!
Thomas Schwentick

Thomas Schwentick

D-Index & Metrics

Computer Science

D-Index
44
Citations
6734
World Ranking
7668
National Ranking
377

Research.com Recognitions

  • 2013 - Member of Academia Europaea

Overview

Thomas Schwentick is affiliated with TU Dortmund University in Germany. The primary area of their research lies within computer science, focusing on several subfields including artificial intelligence, computational theory and mathematics, computer networks and communications, hardware and architecture, and signal processing.

The main research topics covered by Thomas Schwentick include:

  • Advanced Database Systems and Queries
  • Logic, Reasoning, and Knowledge
  • Logic, Programming, and Type Systems
  • Formal Methods in Verification
  • Semigroups and Automata Theory
  • Parallel Computing and Optimization Techniques
  • Algorithms and Data Compression

Schwentick has contributed extensively to the academic literature with notable papers such as:

  • "Sketches of Dynamic Complexity," 2020, ACM SIGMOD Record
  • "Dynamic Complexity Meets Parameterised Algorithms," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Rewriting with Acyclic Queries: Mind Your Head," 2022, arXiv (Cornell University)
  • "Rewriting with Acyclic Queries: Mind Your Head," 2023, Logical Methods in Computer Science
  • "Distribution Constraints: The Chase for Distributed Data," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators in their work include Nils Vortmeier, Thomas Zeume, Gaetano Geck, Jens Keppeler, and Christopher Spinrath. This collaborative network has contributed to ongoing research across various topics in theoretical computer science and database theory.

Thomas Schwentick's publications have appeared predominantly in:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • ACM SIGMOD Record
  • Logical Methods in Computer Science

In recognition of their contribution to science, Thomas Schwentick was elected as a member of the Academia Europaea in 2013.

Best Publications

  • Finite state machines for strings over infinite alphabets

    Frank Neven;Thomas Schwentick;Victor Vianu

  • Two-variable logic on data trees and XML reasoning

    Mikoaj Bojańczyk;Anca Muscholl;Thomas Schwentick;Luc Segoufin

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

    Frank Neven;Thomas Schwentick

  • Two-Variable Logic on Words with Data

    M. Bojanczyk;A. Muscholl;T. Schwentick;Luc Segoufin

  • When is the evaluation of conjunctive queries tractable

    Martin Grohe;Thomas Schwentick;Luc Segoufin

  • Expressiveness and complexity of XML Schema

    Wim Martens;Frank Neven;Thomas Schwentick;Geert Jan Bex

  • Two-variable logic on data words

    Mikołaj Bojańczyk;Claire David;Anca Muscholl;Thomas Schwentick

  • Automata for XML---A survey

    Thomas Schwentick

  • Inference of concise DTDs from XML data

    Geert Jan Bex;Frank Neven;Thomas Schwentick;Karl Tuyls

  • XPath query containment

    Thomas Schwentick

  • Query automata over finite trees

    Frank Neven;Thomas Schwentick

  • On the complexity of equational horn clauses

    Kumar Neeraj Vermal;Helmut Seidl;Thomas Schwentick

  • Expressive and Efficient Pattern Languages for Tree-Structured Data.

    Frank Neven;Thomas Schwentick

  • On the power of polynomial time bit-reductions

    U. Hertrampf;C. Lautemann;T. Schwentick;H. Vollmer

  • On the complexity of equational horn clauses

    Kumar Neeraj Verma;Helmut Seidl;Thomas Schwentick

  • On The Complexity Of Xpath Containment In The Presence Of Disjunction, Dtds, And Variables

    Frank Neven;Thomas Schwentick

  • Inference of concise regular expressions and DTDs

    Geert Jan Bex;Frank Neven;Thomas Schwentick;Stijn Vansummeren

  • Generalized hypertree decompositions: NP-hardness and tractable variants

    Georg Gottlob;Zoltán Miklós;Thomas Schwentick

  • On notions of regularity for data languages

    Henrik Björklund;Thomas Schwentick

  • Counting in Trees for Free

    Helmut Seidl;Thomas Schwentick;Anca Muscholl;Peter Habermehl

  • Two-variable logic on data trees and XML reasoning

    Mikolaj Bojańczyk;Claire David;Anca Muscholl;Thomas Schwentick

  • Theory of computing systems

    W. Bartol;Z. Raś;A. Skowron

Frequent Co-Authors

Frank Neven
Frank Neven Hasselt University
Luc Segoufin
Luc Segoufin French Institute for Research in Computer Science and Automation - INRIA
Georg Gottlob
Georg Gottlob University of Calabria
Dan Suciu
Dan Suciu University of Washington
Victor Vianu
Victor Vianu University of California, San Diego
Helmut Seidl
Helmut Seidl Technical University of Munich
Leonid Libkin
Leonid Libkin University of Edinburgh
Marcelo Arenas
Marcelo Arenas Pontificia Universidad Católica de Chile
Martin Grohe
Martin Grohe RWTH Aachen University
Serge Abiteboul
Serge Abiteboul École Normale Supérieure

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to various specialized online degrees that can diversify your career pathway. For students interested in protecting digital assets and understanding the evolving threat landscape, a cyber security degree offers in-depth knowledge of information systems security and risk management. These programs combine technical skills with practical strategies for real-world problems.

Computer Science foundations also pair well with fields outside pure technology. An online construction management degree cost is increasingly relevant, as building projects rely on digital planning and project tracking tools. Similarly, integrating tech with legal studies through a masters in criminology online can prepare you for roles in digital forensics or cybersecurity law.

Finally, students who value finance and analytics may benefit from online accounting classes that emphasize data systems, automation, and security—skills increasingly in demand across industries. These related online programs provide flexibility, lower costs, and interdisciplinary knowledge crucial for today’s competitive job market.

Best Scientists Citing Thomas Schwentick

Trending Scientists

Recently Published Articles