Péter P. Pálfy
- Discrete Mathematics and Combinatorics top 1%
- Artificial Intelligence top 5%
- Electrical and Electronic Engineering
- Computational Theory and Mathematics top 5%
- Geometry and Topology top 5%
- Co-authors
- László BabaiPavel PudlákPeter J. CameronWilliam M. KantorJan SaxlEugene M. LuksÁkos SeressCai Heng Li
- Topics
- Finite Group Theory Research (22 papers)Coding theory and cryptography (17 papers)graph theory and CDMA systems (9 papers)
- Partner nations
- HungaryUnited StatesUnited Kingdom
In The Last Decade
Péter P. Pálfy
27 papers receiving 429 citations
Peers
Comparison fields: 5 of 25
- Discrete Mathematics and Combinatorics 378
- Artificial Intelligence 273
- Electrical and Electronic Engineering 221
- Computational Theory and Mathematics 134
- Geometry and Topology 111
Countries citing papers authored by Péter P. Pálfy
This map shows the geographic impact of Péter P. Pálfy'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 Péter P. Pálfy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Péter P. Pálfy more than expected).
Fields of papers citing papers by Péter P. Pálfy
This network shows the impact of papers produced by Péter P. Pálfy. 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 Péter P. Pálfy. The network helps show where Péter P. Pálfy may publish in the future.
Co-authorship network of co-authors of Péter P. Pálfy
This figure shows the co-authorship network connecting the top 25 collaborators of Péter P. Pálfy. A scholar is included among the top collaborators of Péter P. Pálfy 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 Péter P. Pálfy. Péter P. Pálfy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 7 | |
| 3 | Three remarks on absolutely solvable groups. | 0 |
| 4 | 22 | |
| 5 | 5 | |
| 6 | 23 | |
| 7 | 6 | |
| 8 | 45 | |
| 9 | 35 | |
| 10 | On Binary Minimal Clones. | 11 |
| 11 | 4 | |
| 12 | 1 | |
| 13 | 2 | |
| 14 | 10 | |
| 15 | 77 | |
| 16 | 2 | |
| 17 | 51 | |
| 18 | 49 | |
| 19 | 43 | |
| 20 | 8 |
About Péter P. Pálfy
Péter P. Pálfy is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory and Theoretical Computer Science, having authored 32 papers that have together received 474 indexed citations. Recurring topics across this work include Finite Group Theory Research (22 papers), Coding theory and cryptography (17 papers) and graph theory and CDMA systems (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (378 citations), Geometry and Topology (111 citations) and Algebra and Number Theory (56 citations). Péter P. Pálfy has collaborated with scholars based in Hungary, United States and United Kingdom. Frequent co-authors include László Babai, Pavel Pudlák, Peter J. Cameron, William M. Kantor, Jan Saxl, Eugene M. Luks, Ákos Seress, Cai Heng Li, Ágnes Szendrei and L. Pyber. Their work appears in journals such as American Mathematical Monthly, Bulletin of the London Mathematical Society and Journal of Algebra.
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.