Thomas Colcombet

1.2k total citations
35 papers, 255 citations indexed

About

Thomas Colcombet is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Thomas Colcombet has authored 35 papers receiving a total of 255 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 6 papers in Molecular Biology. Recurrent topics in Thomas Colcombet's work include semigroups and automata theory (28 papers), Logic, programming, and type systems (17 papers) and Formal Methods in Verification (17 papers). Thomas Colcombet is often cited by papers focused on semigroups and automata theory (28 papers), Logic, programming, and type systems (17 papers) and Formal Methods in Verification (17 papers). Thomas Colcombet collaborates with scholars based in France, Poland and Germany. Thomas Colcombet's co-authors include Christof Löding, Mikołaj Bojańczyk, Pascal Fradet, Damian Niwiński, Michael Benedikt, Balder ten Cate, Stefan Göller, Wolfgang Thomas, Paweł Parys and Paweł Gawrychowski and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Thomas Colcombet

29 papers receiving 236 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Thomas Colcombet France 9 192 170 41 29 29 35 255
Christof Löding Germany 10 203 1.1× 227 1.3× 28 0.7× 9 0.3× 19 0.7× 42 296
Panos Rondogiannis Greece 8 130 0.7× 119 0.7× 30 0.7× 17 0.6× 12 0.4× 41 172
Artur Jeż Poland 10 191 1.0× 178 1.0× 33 0.8× 65 2.2× 14 0.5× 37 244
Sophie Tison France 7 161 0.8× 148 0.9× 41 1.0× 10 0.3× 11 0.4× 30 199
Wojciech Plandowski Poland 9 192 1.0× 152 0.9× 13 0.3× 37 1.3× 31 1.1× 28 236
Wiesław Zielonka France 6 226 1.2× 299 1.8× 46 1.1× 39 1.3× 5 0.2× 12 351
John Doner United States 5 195 1.0× 217 1.3× 37 0.9× 29 1.0× 12 0.4× 8 277
Paulo A. S. Veloso Brazil 7 131 0.7× 88 0.5× 42 1.0× 6 0.2× 16 0.6× 51 166
Eugenio G. Omodeo Italy 10 294 1.5× 311 1.8× 86 2.1× 8 0.3× 12 0.4× 63 423
Jacques Loeckx Germany 7 261 1.4× 257 1.5× 41 1.0× 32 1.1× 28 1.0× 18 346

Countries citing papers authored by Thomas Colcombet

Since Specialization
Citations

This map shows the geographic impact of Thomas Colcombet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thomas Colcombet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Colcombet more than expected).

Fields of papers citing papers by Thomas Colcombet

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Colcombet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thomas Colcombet. The network helps show where Thomas Colcombet may publish in the future.

Co-authorship network of co-authors of Thomas Colcombet

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Colcombet. A scholar is included among the top collaborators of Thomas Colcombet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Thomas Colcombet. Thomas Colcombet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Colcombet, Thomas, et al.. (2024). From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. SHILAP Revista de lepidopterología. Volume 3.
2.
Clemente, Lorenzo, et al.. (2023). Cost Automata, Safe Schemes, and Downward Closures. Fundamenta Informaticae. 188(3). 127–178. 1 indexed citations
3.
Colcombet, Thomas, et al.. (2022). The Theory of Universal Graphs for Infinite Duration Games. Logical Methods in Computer Science. Volume 18, Issue 3.
4.
Colcombet, Thomas. (2021). The factorisation forest theorem. HAL (Le Centre pour la Communication Scientifique Directe). 653–693.
5.
Colcombet, Thomas, et al.. (2020). Automata Minimization: a Functorial Approach. Logical Methods in Computer Science. Volume 16, Issue 1. 1 indexed citations
6.
Carton, Olivier, et al.. (2018). An Algebraic Approach to Mso-Definability on Countable Linear Orderings. Institutional Research Information System (University of Udine). 1 indexed citations
7.
Colcombet, Thomas. (2017). Logic and regular cost functions. 1–4.
8.
Colcombet, Thomas & Mikołaj Bojańczyk. (2017). Boundedness in languages of infinite words. SHILAP Revista de lepidopterología. 13. 1 indexed citations
9.
Colcombet, Thomas, et al.. (2017). Automata and minimization. 4(2). 4–27. 1 indexed citations
10.
Thomas, Wolfgang, et al.. (2014). Simplification problems for automata and games. RWTH Publications (RWTH Aachen).
11.
Colcombet, Thomas, et al.. (2014). Generalized Data Automata and Fixpoint Logic. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
12.
Colcombet, Thomas. (2013). Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings.. 391–404. 1 indexed citations
13.
Colcombet, Thomas. (2013). Regular Cost Functions, Part I: Logic and Algebra over Words. Logical Methods in Computer Science. Volume 9, Issue 3. 11 indexed citations
14.
Colcombet, Thomas. (2012). Forms of Determinism for Automata (Invited Talk). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
15.
Colcombet, Thomas & Christof Löding. (2008). Automata, Languages and Programming. Lecture notes in computer science. 31 indexed citations
16.
Colcombet, Thomas. (2007). Factorisation forests for infinite words application to countable scattered linear orderings. 411. 226–237. 3 indexed citations
17.
Colcombet, Thomas. (2007). A combinatorial theorem for trees applications to monadic logic and infinite structures. 901–912. 5 indexed citations
18.
Bojańczyk, Mikołaj & Thomas Colcombet. (2005). Tree-walking automata cannot be determinized. Theoretical Computer Science. 350(2-3). 164–173. 15 indexed citations
19.
Colcombet, Thomas & Damian Niwiński. (2005). On the positional determinacy of edge-labeled games. Theoretical Computer Science. 352(1-3). 190–196. 5 indexed citations
20.
Colcombet, Thomas & Pascal Fradet. (2000). Enforcing trace properties by program transformation. 54–66. 56 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Christof Löding Breakdown of academic impact, for papers by Panos Rondogiannis Breakdown of academic impact, for papers by Artur Jeż Breakdown of academic impact, for papers by Sophie Tison Breakdown of academic impact, for papers by Wojciech Plandowski Breakdown of academic impact, for papers by Wiesław Zielonka Breakdown of academic impact, for papers by John Doner Breakdown of academic impact, for papers by Paulo A. S. Veloso Breakdown of academic impact, for papers by Eugenio G. Omodeo Breakdown of academic impact, for papers by Jacques Loeckx
Rankless by CCL
2026