Nicholas Spooner
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Multi-Objective Optimization Algorithms
-
- Metaheuristic Optimization Algorithms Research
- Evolutionary Algorithms and Applications
- Cryptography and Data Security
- Privacy-Preserving Technologies in Data
Papers in
-
- Cryptography and Data Security 5
- Logic, programming, and type systems 2
- Privacy-Preserving Technologies in Data 1
- Evolutionary Algorithms and Applications 1
- Logic, Reasoning, and Knowledge 1
- Metaheuristic Optimization Algorithms Research 1
-
- Complexity and Algorithms in Graphs 3
- Co-authors
- Johannes Lengler (1 shared paper)Alessandro Chiesa (4 shared papers)Michael Riabzev (2 shared papers)Eli Ben‐Sasson (2 shared papers)Ariel Gabizon (2 shared papers)Michael A. Forbes (2 shared papers)Tom Gur (3 shared papers)Jack O’Connor (1 shared paper)
- Journals
- Journal of the ACM (1 paper)Warwick Research Archive Portal (University of Warwick) (1 paper)IACR Cryptology ePrint Archive (1 paper)DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) (1 paper)
- Partner nations
- United StatesSwitzerlandIsrael
In The Last Decade
Nicholas Spooner
5 papers receiving 36 citations
Peers
Comparison fields: 5 of 15
- Computational Theory and Mathematics 23
- Artificial Intelligence 34
- Information Systems 8
- Discrete Mathematics and Combinatorics 1
- Computer Networks and Communications 3
Countries citing papers authored by Nicholas Spooner
This map shows the geographic impact of Nicholas Spooner'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 Nicholas Spooner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicholas Spooner more than expected).
Fields of papers citing papers by Nicholas Spooner
This network shows the impact of papers produced by Nicholas Spooner. 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 Nicholas Spooner. The network helps show where Nicholas Spooner may publish in the future.
Co-authors
The 8 scholars most cited alongside Nicholas Spooner, 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 | 2015 | 18 | |
| 2 | 2017 | 12 | |
| 3 | Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. | 2016 | 3 |
| 4 | 2022 | 2 | |
| 5 | 2018 | 2 | |
| 6 | 2024 | 0 |
About Nicholas Spooner
Nicholas Spooner is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Infectious Diseases and Organic Chemistry, having authored 6 papers that have together received 37 indexed citations. Recurring topics across this work include Cryptography and Data Security (5 papers), Complexity and Algorithms in Graphs (3 papers), Logic, programming, and type systems (2 papers), Blockchain Technology Applications and Security (2 papers), Privacy-Preserving Technologies in Data (1 paper), Evolutionary Algorithms and Applications (1 paper), Logic, Reasoning, and Knowledge (1 paper) and Metaheuristic Optimization Algorithms Research (1 paper). The work is most often cited by research in Computational Theory and Mathematics (23 citations), Artificial Intelligence (34 citations), Information Systems (8 citations), Discrete Mathematics and Combinatorics (1 citation) and Computer Networks and Communications (3 citations). Nicholas Spooner has collaborated with scholars based in United States, Switzerland and Israel. Frequent co-authors include Johannes Lengler, Alessandro Chiesa, Michael Riabzev, Eli Ben‐Sasson, Ariel Gabizon, Michael A. Forbes, Tom Gur and Jack O’Connor. Their work appears in journals such as Journal of the ACM, Warwick Research Archive Portal (University of Warwick), IACR Cryptology ePrint Archive and DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
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.