( en | de | ru )

 

Disambiguation of "Schwentick, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award.

, , and . PODS, page 82. ACM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Schwentick

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)
 

Other publications of authors with the same name

Parallel-Correctness and Parallel-Boundedness for Datalog Programs., , , and . ICDT, volume 127 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Automata for Unary Queries on Trees., and . Grundlagen von Datenbanken, volume Math/Inf/99/16 of Jeaner Schriften zur Mathematik und Informatik, page 102-106. Friedrich-Schiller-Universität Jena, (1999)Distribution Constraints: The Chase for Distributed Data., , and . ICDT, volume 155 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Logically defined queries on trees.. Grundlagen von Datenbanken, volume Nr. 2005 of Berichte, page 96-100. Christian-Albrechts-Universität Kiel, (2000)Winning Strategies for Streaming Rewriting Games., , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 49-63. Springer, (2019)Rewriting with Acyclic Queries: Mind Your Head., , , and . ICDT, volume 220 of LIPIcs, page 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Ackermann Award 2021.. Bull. EATCS, (2021)On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages., , and . MFCS, volume 272 of LIPIcs, page 81:1-81:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work., and . MFCS, volume 272 of LIPIcs, page 80:1-80:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Low-Latency Sliding Window Algorithms for Formal Languages., , , and . FSTTCS, volume 250 of LIPIcs, page 38:1-38:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)