Patrick Cégielski
Impact in
-
- Analytic Number Theory Research
-
- Limits and Structures in Graph Theory
Papers in
-
- Computability, Logic, AI Algorithms 13
- semigroups and automata theory 12
- Advanced Algebra and Logic 7
-
- Algorithms and Data Compression 8
- Logic, programming, and type systems 5
- Co-authors
- Irène Guessarian (13 shared papers)Yuri Matiyasevich (8 shared papers)Luc Boasson (3 shared papers)Yury Lifshits (1 shared paper)Serge Grigorieff (6 shared papers)Kenneth McAloon (1 shared paper)Roman Kossak (1 shared paper)Thomas Clausen (1 shared paper)
In The Last Decade
Patrick Cégielski
31 papers receiving 206 citations
Peers
Comparison fields: 5 of 30
- Algebra and Number Theory 49
- Discrete Mathematics and Combinatorics 33
- Computational Theory and Mathematics 125
- Geometry and Topology 49
- Theoretical Computer Science 6
Countries citing papers authored by Patrick Cégielski
This map shows the geographic impact of Patrick Cégielski'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 Patrick Cégielski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Patrick Cégielski more than expected).
Fields of papers citing papers by Patrick Cégielski
This network shows the impact of papers produced by Patrick Cégielski. 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 Patrick Cégielski. The network helps show where Patrick Cégielski may publish in the future.
Co-authors
The 17 scholars most cited alongside Patrick Cégielski, 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 36 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | On the Additive Theory of Prime Numbers | 2008 | 48 |
| 2 | 2006 | 20 | |
| 3 | 2001 | 19 | |
| 4 | 2010 | 19 | |
| 5 | 1999 | 13 | |
| 6 | 1999 | 11 | |
| 7 | 1996 | 9 | |
| 8 | 2001 | 8 | |
| 9 | 1981 | 7 | |
| 10 | 1996 | 7 | |
| 11 | 1982 | 6 | |
| 12 | New studies in weak arithmetics | 2013 | 6 |
| 13 | 2006 | 6 | |
| 14 | Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 04) | 2005 | 5 |
| 15 | Window Accumulated Subsequence Matching is linear | 1999 | 5 |
| 16 | La théorie élémentaire de la divisibilité est finiment axiomatisable | 1984 | 4 |
| 17 | 2008 | 4 | |
| 18 | 2009 | 3 | |
| 19 | 2013 | 3 | |
| 20 | Studies in weak arithmetics | 2010 | 3 |
About Patrick Cégielski
Patrick Cégielski is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Algebra and Number Theory and Mathematical Physics, having authored 36 papers that have together received 226 indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (13 papers), semigroups and automata theory (12 papers), Algorithms and Data Compression (8 papers), Advanced Algebra and Logic (7 papers), Logic, programming, and type systems (5 papers), Mathematical and Theoretical Analysis (5 papers), Advanced Topology and Set Theory (5 papers) and History and Theory of Mathematics (3 papers). The work is most often cited by research in Algebra and Number Theory (49 citations), Discrete Mathematics and Combinatorics (33 citations), Computational Theory and Mathematics (125 citations), Geometry and Topology (49 citations) and Theoretical Computer Science (6 citations). Patrick Cégielski has collaborated with scholars based in France and Russia. Frequent co-authors include Irène Guessarian, Yuri Matiyasevich, Luc Boasson, Yury Lifshits, Serge Grigorieff, Kenneth McAloon, Roman Kossak, Thomas Clausen, Benjamin Nguyen and Thierry Viéville. Their work appears in journals such as Theoretical Computer Science, Journal of Symbolic Logic, Annals of Pure and Applied Logic, Notre Dame Journal of Formal Logic and Lecture notes in mathematics.
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.