Pascal Tesson
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Computer Networks and Communications
- Molecular Biology
- Electrical and Electronic Engineering
- Co-authors
- Denis ThérienBenoît LaroseAndrei KrokhinRicard GavaldàHoward StraubingVíctor DalmauArkadev ChattopadhyayAndreas Krebs
- Topics
- semigroups and automata theory (14 papers)Logic, programming, and type systems (6 papers)Advanced Graph Theory Research (5 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsArtificial Intelligence
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Pascal Tesson
14 papers receiving 127 citations
Peers
Comparison fields: 5 of 13
- Computational Theory and Mathematics 126
- Artificial Intelligence 81
- Computer Networks and Communications 29
- Molecular Biology 13
- Electrical and Electronic Engineering 12
Countries citing papers authored by Pascal Tesson
This map shows the geographic impact of Pascal Tesson'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 Pascal Tesson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Tesson more than expected).
Fields of papers citing papers by Pascal Tesson
This network shows the impact of papers produced by Pascal Tesson. 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 Pascal Tesson. The network helps show where Pascal Tesson may publish in the future.
Co-authorship network of co-authors of Pascal Tesson
This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Tesson. A scholar is included among the top collaborators of Pascal Tesson 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 Pascal Tesson. Pascal Tesson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 11 | |
| 2 | 1 | |
| 3 | 2 | |
| 4 | Symmetric Datalog and Constraint Satisfaction Problems in Logspace. | 0 |
| 5 | 1 | |
| 6 | 18 | |
| 7 | 20 | |
| 8 | 0 | |
| 9 | Bridges between Algebraic Automata Theory and Complexity Theory. | 2 |
| 10 | 1 | |
| 11 | 1 | |
| 12 | 4 | |
| 13 | 2 | |
| 14 | 9 | |
| 15 | 10 | |
| 16 | The atnext/atprevious Hierarchy on the Starfree Languages | 0 |
| 17 | Computational complexity questions related to finite monoids and semigroups | 19 |
| 18 | 0 | |
| 19 | 35 |
About Pascal Tesson
Pascal Tesson is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, having authored 19 papers that have together received 136 indexed citations. Recurring topics across this work include semigroups and automata theory (14 papers), Logic, programming, and type systems (6 papers) and Advanced Graph Theory Research (5 papers). The work is most often cited by research in Computational Theory and Mathematics (126 citations), Discrete Mathematics and Combinatorics (9 citations) and Artificial Intelligence (81 citations). Pascal Tesson has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Denis Thérien, Benoît Larose, Andrei Krokhin, Ricard Gavaldà, Howard Straubing, Víctor Dalmau, Arkadev Chattopadhyay, Andreas Krebs, Márió Szegedy and Michal Koucký. Their work appears in journals such as Theoretical Computer Science, Lecture notes in computer science and Information and Computation.
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.