Bruce M. Kapron
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Sociology and Political Science
- Information Systems
- Co-authors
- Valerie KingStephen CookVenkatesh SrinivasanGautam SrivastavaRussell ImpagliazzoSean ChesterAlex ThomoDavid Kempe
- Topics
- Cryptography and Data Security (13 papers)Logic, programming, and type systems (12 papers)Logic, Reasoning, and Knowledge (11 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceComputer Networks and Communications
- Partner nations
- CanadaUnited StatesSingapore
In The Last Decade
Bruce M. Kapron
35 papers receiving 418 citations
Peers
Comparison fields: 5 of 40
- Artificial Intelligence 320
- Computational Theory and Mathematics 191
- Computer Networks and Communications 124
- Sociology and Political Science 79
- Information Systems 36
Countries citing papers authored by Bruce M. Kapron
This map shows the geographic impact of Bruce M. Kapron'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 Bruce M. Kapron with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bruce M. Kapron more than expected).
Fields of papers citing papers by Bruce M. Kapron
This network shows the impact of papers produced by Bruce M. Kapron. 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 Bruce M. Kapron. The network helps show where Bruce M. Kapron may publish in the future.
Co-authorship network of co-authors of Bruce M. Kapron
This figure shows the co-authorship network connecting the top 25 collaborators of Bruce M. Kapron. A scholar is included among the top collaborators of Bruce M. Kapron 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 Bruce M. Kapron. Bruce M. Kapron 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 | 3 | |
| 3 | 2 | |
| 4 | 1 | |
| 5 | On a variant of multilinear modular hashing with applications to authentication and secrecy codes | 1 |
| 6 | 10 | |
| 7 | 4 | |
| 8 | 5 | |
| 9 | 0 | |
| 10 | 37 | |
| 11 | 31 | |
| 12 | 32 | |
| 13 | k-Anonymization of Social Networks by Vertex Addition. | 31 |
| 14 | Fast asynchronous byzantine agreement and leader election with full information | 10 |
| 15 | 28 | |
| 16 | 4 | |
| 17 | 15 | |
| 18 | 2 | |
| 19 | 2 | |
| 20 | 8 |
About Bruce M. Kapron
Bruce M. Kapron is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 39 papers that have together received 436 indexed citations. Recurring topics across this work include Cryptography and Data Security (13 papers), Logic, programming, and type systems (12 papers) and Logic, Reasoning, and Knowledge (11 papers). The work is most often cited by research in Computational Theory and Mathematics (191 citations), Artificial Intelligence (320 citations) and Computer Networks and Communications (124 citations). Bruce M. Kapron has collaborated with scholars based in Canada, United States and Singapore. Frequent co-authors include Valerie King, Stephen Cook, Venkatesh Srinivasan, Gautam Srivastava, Russell Impagliazzo, Sean Chester, Alex Thomo, David Kempe, Jared Saia and Vishal Sanwalani. Their work appears in journals such as Nuclear Physics B, SIAM Journal on Computing and Theoretical Computer Science.
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.