Peter Gemmell

1.5k total citations
13 papers, 609 citations indexed

About

Peter Gemmell is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Peter Gemmell has authored 13 papers receiving a total of 609 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Peter Gemmell's work include Cryptography and Data Security (7 papers), Complexity and Algorithms in Graphs (4 papers) and Security and Verification in Computing (4 papers). Peter Gemmell is often cited by papers focused on Cryptography and Data Security (7 papers), Complexity and Algorithms in Graphs (4 papers) and Security and Verification in Computing (4 papers). Peter Gemmell collaborates with scholars based in United States. Peter Gemmell's co-authors include Madhu Sudan, Manuel Blum, S. Kannan, Moni Naor, William J. Evans, Moti Yung, Yair Frankel, Richard Lipton, Ronitt Rubinfeld and David W. Kravitz and has published in prestigious journals such as Algorithmica, Journal of Cryptology and Information Processing Letters.

In The Last Decade

Peter Gemmell

13 papers receiving 547 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Peter Gemmell United States 10 490 234 227 158 48 13 609
Donald Beaver United States 11 748 1.5× 460 2.0× 303 1.3× 404 2.6× 61 1.3× 16 1.1k
Martin Fürer United States 13 294 0.6× 201 0.9× 473 2.1× 93 0.6× 108 2.3× 38 744
C. Pandu Rangan India 17 306 0.6× 344 1.5× 608 2.7× 99 0.6× 98 2.0× 102 901
Bogdan Warinschi United Kingdom 18 711 1.5× 386 1.6× 149 0.7× 405 2.6× 36 0.8× 55 861
Jeremy Jacob United Kingdom 12 321 0.7× 170 0.7× 58 0.3× 219 1.4× 45 0.9× 25 484
Michaël Rusinowitch France 14 560 1.1× 296 1.3× 297 1.3× 191 1.2× 23 0.5× 79 710
Santiago Zanella-Béguelin United Kingdom 13 541 1.1× 154 0.7× 124 0.5× 145 0.9× 38 0.8× 23 646
Iliano Cervesato United States 18 652 1.3× 449 1.9× 275 1.2× 286 1.8× 17 0.4× 68 860
Duško Pavlović United States 14 353 0.7× 340 1.5× 152 0.7× 275 1.7× 25 0.5× 62 584
Mark E. Stickel United States 18 825 1.7× 173 0.7× 422 1.9× 58 0.4× 14 0.3× 37 932

Countries citing papers authored by Peter Gemmell

Since Specialization
Citations

This map shows the geographic impact of Peter Gemmell'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 Peter Gemmell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Gemmell more than expected).

Fields of papers citing papers by Peter Gemmell

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Gemmell. 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 Peter Gemmell. The network helps show where Peter Gemmell may publish in the future.

Co-authorship network of co-authors of Peter Gemmell

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Gemmell. A scholar is included among the top collaborators of Peter Gemmell 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 Peter Gemmell. Peter Gemmell is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Frankel, Yair, Peter Gemmell, Philip MacKenzie, & Moti Yung. (2002). Optimal-resilience proactive public-key cryptosystems. 384–393. 81 indexed citations
2.
Gemmell, Peter, et al.. (2002). Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack. Journal of Cryptology. 15(2). 139–148. 20 indexed citations
3.
Blum, Manuel, William J. Evans, Peter Gemmell, S. Kannan, & Moni Naor. (2002). Checking the correctness of memories. 90–99. 50 indexed citations
4.
Codenotti, Bruno, et al.. (1997). On the Amount of Randomness Needed in Distributed Computations.. 10(4). 237–248. 3 indexed citations
5.
Gemmell, Peter. (1997). Traceable e-cash. IEEE Spectrum. 34(2). 35–37. 8 indexed citations
6.
Boldi, Paolo, et al.. (1996). Symmetry Breaking in Anonymous Networks: Characterizations.. 16–26. 42 indexed citations
7.
Frankel, Yair, Peter Gemmell, & Moti Yung. (1996). Witness-based cryptographic program checking and robust function sharing. 499–508. 22 indexed citations
8.
Brickell, Ernie, Peter Gemmell, & David W. Kravitz. (1995). Trustee-based tracing extensions to anonymous cash and the making of anonymous change. Symposium on Discrete Algorithms. 457–466. 60 indexed citations
9.
Gemmell, Peter, et al.. (1994). Tight bounds on expected time to add correctly and odd mostly correctly. Information Processing Letters. 49(2). 77–83. 1 indexed citations
10.
Blum, Manuel, William J. Evans, Peter Gemmell, S. Kannan, & Moni Naor. (1994). Checking the correctness of memories. Algorithmica. 12(2-3). 225–244. 106 indexed citations
11.
Codenotti, Bruno, et al.. (1993). Checking approximate computations over the reals. ISTI Open Portal. 786–795. 19 indexed citations
12.
Gemmell, Peter & Madhu Sudan. (1992). Highly resilient correctors for polynomials. Information Processing Letters. 43(4). 169–174. 97 indexed citations
13.
Gemmell, Peter, Richard Lipton, Ronitt Rubinfeld, Madhu Sudan, & Avi Wigderson. (1991). Self-testing/correcting for polynomials and for approximate functions. 33–42. 100 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

Rankless by CCL
2026