Pascal Tesson
Impact in
-
- semigroups and automata theory
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Advanced Algebra and Logic
- Computability, Logic, AI Algorithms
-
- Finite Group Theory Research
Papers in
-
- semigroups and automata theory 21
- Advanced Graph Theory Research 9
- Complexity and Algorithms in Graphs 4
-
- Mineralogy and Gemology Studies 1
- Co-authors
- Denis Thérien (21 shared papers)Benoît Larose (7 shared papers)Andrei Krokhin (2 shared papers)Pierre McKenzie (1 shared paper)Cristopher Moore (1 shared paper)David Mix Barrington (1 shared paper)Ricard Gavaldà (2 shared papers)Frank Stephan (2 shared papers)
- Journals
- Theory of Computing Systems (3 papers)International Journal of Algebra and Computation (2 papers)Lecture notes in computer science (11 papers)Information and Computation (1 paper)Theoretical Computer Science (1 paper)
- Partner nations
- CanadaUnited StatesGermany
In The Last Decade
Pascal Tesson
29 papers receiving 349 citations
Peers
Comparison fields: 5 of 7
- Computational Theory and Mathematics 343
- Discrete Mathematics and Combinatorics 14
- Artificial Intelligence 38
- Computer Networks and Communications 20
- Geometry and Topology 9
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-authors
The 17 scholars most cited alongside Pascal Tesson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 30 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 66 | |
| 2 | 2007 | 58 | |
| 3 | 2007 | 28 | |
| 4 | Computational complexity questions related to finite monoids and semigroups | 2003 | 27 |
| 5 | 2007 | 25 | |
| 6 | 2004 | 19 | |
| 7 | 2005 | 19 | |
| 8 | 1998 | 17 | |
| 9 | 2000 | 14 | |
| 10 | 2011 | 14 | |
| 11 | 2004 | 11 | |
| 12 | 2001 | 9 | |
| 13 | 2005 | 8 | |
| 14 | 2003 | 6 | |
| 15 | 2004 | 6 | |
| 16 | 2007 | 6 | |
| 17 | Bridges between Algebraic Automata Theory and Complexity Theory. | 2006 | 5 |
| 18 | 2005 | 4 | |
| 19 | 2006 | 4 | |
| 20 | 2002 | 3 |
About Pascal Tesson
Pascal Tesson is a scholar working on Computational Theory and Mathematics, Geochemistry and Petrology, Artificial Intelligence, Plant Science and Materials Chemistry, having authored 30 papers that have together received 368 indexed citations. Recurring topics across this work include semigroups and automata theory (21 papers), Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (4 papers), Logic, Reasoning, and Knowledge (2 papers), Diamond and Carbon-based Materials Research (1 paper), Mineralogy and Gemology Studies (1 paper) and Genetics and Plant Breeding (1 paper). The work is most often cited by research in Computational Theory and Mathematics (343 citations), Discrete Mathematics and Combinatorics (14 citations), Artificial Intelligence (38 citations), Computer Networks and Communications (20 citations) and Geometry and Topology (9 citations). Pascal Tesson has collaborated with scholars based in Canada, United States and Germany. Frequent co-authors include Denis Thérien, Benoît Larose, Andrei Krokhin, Pierre McKenzie, Cristopher Moore, David Mix Barrington, Ricard Gavaldà, Frank Stephan, Klaus-Jörn Lange and Arkadev Chattopadhyay. Their work appears in journals such as Theory of Computing Systems, International Journal of Algebra and Computation, Lecture notes in computer science, Information and Computation and Theoretical Computer Science.
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.