| 2026 | ICALP | Expregular Functions. | Thomas Colcombet, Nathan Lhote, Pierre Ohlmann |
| 2026 | LICS | The Uniformisation of Monadic Second-Order Logic over Countable Ordinals. | Thomas Colcombet, Alexander Rabinovich |
| 2025 | CSL | On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates. | Thomas Colcombet, Alexander Rabinovich |
| 2025 | ICALP | Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. | Thomas Colcombet, Amina Doumane, Denis Kuperberg |
| 2025 | MFCS | Lambdas, Transducers and MSO (Invited Talk). | Thomas Colcombet |
| 2023 | LICS | ℤ-polyregular functions. | Thomas Colcombet, Gatan Douneau-Tabot, Aliaume Lopez |
| 2022 | FOSSACS | First-order separation over countable ordinals. | Thomas Colcombet, Sam van Gool, Rmi Morvan |
| 2022 | ICALP | On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. | Antonio Casares, Thomas Colcombet, Karoliina Lehtinen |
| 2022 | MFCS | A Complexity Approach to Tree Algebras: the Polynomial Case. | Thomas Colcombet, Arthur Jaquard |
| 2021 | CSL | Learning Automata and Transducers: A Categorical Approach. | Thomas Colcombet, Daniela Petrisan, Riccardo Stabile |
| 2021 | ICALP | Optimal Transformations of Games and Automata Using Muller Conditions. | Antonio Casares, Thomas Colcombet, Nathanal Fijalkow |
| 2021 | ICALP | A Complexity Approach to Tree Algebras: the Bounded Case. | Thomas Colcombet, Arthur Jaquard |
| 2020 | FOSSACS | Controlling a Random Population. | Thomas Colcombet, Nathanal Fijalkow, Pierre Ohlmann |
| 2020 | ICALP | Cost Automata, Safe Schemes, and Downward Closures. | David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys |
| 2020 | STACS | Unambiguous Separators for Tropical Tree Automata. | Thomas Colcombet, Sylvain Lombardy |
| 2019 | FOSSACS | Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. | Thomas Colcombet, Nathanal Fijalkow |
| 2019 | ICALP | On Reachability Problems for Low-Dimensional Matrix Semigroups. | Thomas Colcombet, Jol Ouaknine, Pavel Semukhin, James Worrell |
| 2017 | CALCO | Automata Minimization: a Functorial Approach. | Thomas Colcombet, Daniela Petrisan |
| 2017 | FCT | Automata and Program Analysis. | Thomas Colcombet, Laure Daviaud, Florian Zuleger |
| 2017 | LICS | Logic and regular cost functions. | Thomas Colcombet |
| 2017 | LICS | Perfect half space games. | Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz |
| 2017 | MFCS | Automata in the Category of Glued Vector Spaces. | Thomas Colcombet, Daniela Petrisan |
| 2016 | ICALP | The Bridge Between Regular Cost Functions and Omega-Regular Languages. | Thomas Colcombet, Nathanal Fijalkow |
| 2016 | LICS | Games with bound guess actions. | Thomas Colcombet, Stefan Gller |
| 2016 | STACS | On a Fragment of AMSO and Tiling Systems. | Achim Blumensath, Thomas Colcombet, Pawel Parys |
| 2016 | STACS | Cost Functions Definable by Min/Max Automata. | Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk |
| 2015 | ICALP | Limited Set quantifiers over Countable Linear Orderings. | Thomas Colcombet, A. V. Sreejith |
| 2015 | LICS | The Complexity of Boundedness for Guarded Logics. | Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom |
| 2015 | STACS | Combinatorial Expressions and Lower Bounds. | Thomas Colcombet, Amaldev Manuel |
| 2014 | CSL | Two-way cost automata and cost logics over infinite trees. | Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom |
| 2014 | MFCS | Asymptotic Monadic Second-Order Logic. | Achim Blumensath, Olivier Carton, Thomas Colcombet |
| 2014 | MFCS | Size-Change Abstraction and Max-Plus Automata. | Thomas Colcombet, Laure Daviaud, Florian Zuleger |
| 2013 | CSL | Deciding the weak definability of Bchi definable tree languages. | Thomas Colcombet, Denis Kuperberg, Christof Lding, Michael Vanden Boom |
| 2013 | CSR | Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings. | Thomas Colcombet |
| 2013 | LICS | Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. | Thomas Colcombet |
| 2013 | STACS | Approximate comparison of distance automata. | Thomas Colcombet, Laure Daviaud |
| 2012 | STACS | Forms of Determinism for Automata (Invited Talk). | Thomas Colcombet |
| 2011 | ICALP | Regular Languages of Words over Countable Linear Orderings. | Olivier Carton, Thomas Colcombet, Gabriele Puppis |
| 2011 | LATA | Green's Relations and Their Use in Automata Theory. | Thomas Colcombet |
| 2011 | MFCS | On the Use of Guards for Logics with Data. | Thomas Colcombet, Clemens Ley, Gabriele Puppis |
| 2010 | ICALP | Regular Temporal Cost Functions. | Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy |
| 2010 | LICS | Regular Cost Functions over Finite Trees. | Thomas Colcombet, Christof Lding |
| 2009 | ICALP | The Theory of Stabilisation Monoids and Regular Cost Functions. | Thomas Colcombet |
| 2009 | ICALP | A Tight Lower Bound for Determinization of Transition Labeled Bchi Automata. | Thomas Colcombet, Konrad Zdanowski |
| 2008 | CSL | The Nesting-Depth of Disjunctive -Calculus for Tree Languages and the Limitedness Problem. | Thomas Colcombet, Christof Lding |
| 2008 | ICALP | The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. | Thomas Colcombet, Christof Lding |
| 2007 | FCT | Factorisation Forests for Infinite Words. | Thomas Colcombet |
| 2007 | ICALP | A Combinatorial Theorem for Trees. | Thomas Colcombet |
| 2006 | LICS | Bounds in w-Regularity. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2005 | STOC | Tree-walking automata do not recognize all regular languages. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2004 | ICALP | Tree-Walking Automata Cannot Be Determinized. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2004 | STACS | On the Expressiveness of Deterministic Transducers over Infinite Trees. | Thomas Colcombet, Christof Lding |
| 2003 | ICALP | On Equivalent Representations of Infinite Structures. | Arnaud Carayol, Thomas Colcombet |
| 2002 | ICALP | On Families of Graphs Having a Decidable First Order Theory with Reachability. | Thomas Colcombet |
| 2000 | POPL | Enforcing Trace Properties by Program Transformation. | Thomas Colcombet, Pascal Fradet |