( en | de | ru )

 

Disambiguation of "Colcombet, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
A Complexity Approach to Tree Algebras: the Bounded Case.

, and . ICALP, volume 198 of LIPIcs, page 127:1-127:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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 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)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

Optimal transformations of Muller conditions., , and . CoRR, (2020)On Reachability Problems for Low-Dimensional Matrix Semigroups., , , and . ICALP, volume 132 of LIPIcs, page 44:1-44:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Complexity Approach to Tree Algebras: the Bounded Case., and . ICALP, volume 198 of LIPIcs, page 127:1-127:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games., , and . ICALP, volume 229 of LIPIcs, page 117:1-117:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Controlling a Random Population., , and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 119-135. Springer, (2020)Enforcing Trace Properties by Program Transformation., and . POPL, page 54-66. ACM, (2000)On the Expressiveness of Deterministic Transducers over Infinite Trees., and . STACS, volume 2996 of Lecture Notes in Computer Science, page 428-439. Springer, (2004)Tree-Walking Automata Cannot Be Determinized., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 246-256. Springer, (2004)Regular Temporal Cost Functions., , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 563-574. Springer, (2010)Size-Change Abstraction and Max-Plus Automata., , and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 208-219. Springer, (2014)