Peter Gemmell
Impact in
- Artificial Intelligence top 2%
- Cryptography and Data Security
- Security and Verification in Computing
- Coding theory and cryptography
- Machine Learning and Algorithms
-
- Complexity and Algorithms in Graphs
Papers in
-
- Cryptography and Data Security 7
- Security and Verification in Computing 4
- Cryptographic Implementations and Security 2
-
- Complexity and Algorithms in Graphs 4
- Computability, Logic, AI Algorithms 2
- Co-authors
- Madhu Sudan (2 shared papers)William J. Evans (2 shared papers)Manuel Blum (2 shared papers)Moni Naor (2 shared papers)S. Kannan (2 shared papers)Yair Frankel (2 shared papers)Moti Yung (2 shared papers)David W. Kravitz (1 shared paper)
- Journals
- Algorithmica (1 paper)Journal of Cryptology (1 paper)Information Processing Letters (2 papers)IEEE Spectrum (1 paper)Symposium on Discrete Algorithms (1 paper)
- Partner nations
- United States
In The Last Decade
Peter Gemmell
13 papers receiving 549 citations
Peers
Comparison fields: 5 of 37
- Artificial Intelligence 492
- Computational Theory and Mathematics 226
- Computer Networks and Communications 236
- Information Systems 158
- Software 19
Countries citing papers authored by Peter Gemmell
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
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-authors
The 17 scholars most cited alongside Peter Gemmell, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 107 | |
| 2 | 1991 | 100 | |
| 3 | 1992 | 96 | |
| 4 | 2002 | 81 | |
| 5 | 1995 | 60 | |
| 6 | 2002 | 52 | |
| 7 | Symmetry Breaking in Anonymous Networks: Characterizations. | 1996 | 43 |
| 8 | 1996 | 22 | |
| 9 | 2002 | 20 | |
| 10 | 1993 | 19 | |
| 11 | 1997 | 8 | |
| 12 | On the Amount of Randomness Needed in Distributed Computations. | 1997 | 3 |
| 13 | 1994 | 1 |
About Peter Gemmell
Peter Gemmell is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Information Systems and Sociology and Political Science, having authored 13 papers that have together received 612 indexed citations. Recurring topics across this work include Cryptography and Data Security (7 papers), Complexity and Algorithms in Graphs (4 papers), Security and Verification in Computing (4 papers), Distributed systems and fault tolerance (3 papers), Computability, Logic, AI Algorithms (2 papers), Cryptographic Implementations and Security (2 papers), Cryptography and Residue Arithmetic (1 paper) and Markov Chains and Monte Carlo Methods (1 paper). The work is most often cited by research in Artificial Intelligence (492 citations), Computational Theory and Mathematics (226 citations), Computer Networks and Communications (236 citations), Information Systems (158 citations) and Software (19 citations). Peter Gemmell has collaborated with scholars based in United States. Frequent co-authors include Madhu Sudan, William J. Evans, Manuel Blum, Moni Naor, S. Kannan, Yair Frankel, Moti Yung, David W. Kravitz, Avi Wigderson and Ronitt Rubinfeld. Their work appears in journals such as Algorithmica, Journal of Cryptology, Information Processing Letters, IEEE Spectrum and Symposium on Discrete Algorithms.
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.