Bruce M. Kapron

1.3k total citations
39 papers, 436 citations indexed

About

Bruce M. Kapron is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Bruce M. Kapron has authored 39 papers receiving a total of 436 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Artificial Intelligence, 22 papers in Computational Theory and Mathematics and 6 papers in Computer Networks and Communications. Recurrent topics in Bruce M. Kapron's work include Cryptography and Data Security (13 papers), Logic, programming, and type systems (12 papers) and Logic, Reasoning, and Knowledge (11 papers). Bruce M. Kapron is often cited by papers focused on Cryptography and Data Security (13 papers), Logic, programming, and type systems (12 papers) and Logic, Reasoning, and Knowledge (11 papers). Bruce M. Kapron collaborates with scholars based in Canada, United States and France. Bruce M. Kapron's co-authors include Valerie King, Stephen Cook, Venkatesh Srinivasan, Gautam Srivastava, Sean Chester, Russell Impagliazzo, Alex Thomo, David Kempe, Vishal Sanwalani and Jared Saia and has published in prestigious journals such as Nuclear Physics B, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Bruce M. Kapron

35 papers receiving 418 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bruce M. Kapron Canada 12 320 191 124 79 36 39 436
Martha Sideri Greece 10 126 0.4× 169 0.9× 132 1.1× 14 0.2× 65 1.8× 18 348
Bruno Barras France 6 395 1.2× 276 1.4× 82 0.7× 10 0.1× 53 1.5× 6 478
Ichiro Hasuo Japan 10 262 0.8× 238 1.2× 34 0.3× 23 0.3× 20 0.6× 64 381
Grigory Yaroslavtsev United States 12 302 0.9× 145 0.8× 85 0.7× 90 1.1× 19 0.5× 21 387
Søren B. Lassen United States 11 287 0.9× 199 1.0× 55 0.4× 11 0.1× 35 1.0× 20 332
Michele Boreale Italy 13 390 1.2× 230 1.2× 195 1.6× 17 0.2× 138 3.8× 43 470
Alessandra Di Pierro Italy 11 368 1.1× 159 0.8× 134 1.1× 28 0.4× 50 1.4× 52 448
Amy Felty Canada 14 413 1.3× 212 1.1× 107 0.9× 72 0.9× 94 2.6× 43 487
Judicaël Courant France 3 369 1.2× 263 1.4× 87 0.7× 12 0.2× 58 1.6× 5 447
Theodore Andronikos Greece 10 189 0.6× 59 0.3× 60 0.5× 23 0.3× 37 1.0× 53 321

Countries citing papers authored by Bruce M. Kapron

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Kapron, Bruce M., et al.. (2022). Authentication of variable length messages in quantum key distribution. EPJ Quantum Technology. 9(1). 8–8. 3 indexed citations
2.
Kapron, Bruce M., et al.. (2022). A tier-based typed programming language characterizing Feasible Functionals. Logical Methods in Computer Science. Volume 18, Issue 1. 1 indexed citations
3.
Kapron, Bruce M., et al.. (2019). A generalization of Schönemann’s theorem via a graph theoretic method. Discrete Mathematics. 342(11). 3057–3061. 2 indexed citations
4.
Kapron, Bruce M. & Florian Steinberg. (2019). Type-two polynomial-time and restricted lookahead. Theoretical Computer Science. 813. 1–19. 1 indexed citations
5.
Kapron, Bruce M., et al.. (2016). On a variant of multilinear modular hashing with applications to authentication and secrecy codes. International Symposium on Information Theory and its Applications. 320–324. 1 indexed citations
6.
Kapron, Bruce M., et al.. (2016). Restricted linear congruences. Journal of Number Theory. 171. 128–144. 10 indexed citations
7.
Kapron, Bruce M., et al.. (2016). Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT. Nuclear Physics B. 910. 712–723. 5 indexed citations
8.
Kapron, Bruce M., et al.. (2016). MMH⁎ with arbitrary modulus is always almost-universal. Information Processing Letters. 116(7). 481–483. 7 indexed citations
9.
Kapron, Bruce M., Lior Malka, & Venkatesh Srinivasan. (2015). A framework for non-interactive instance-dependent commitment schemes (NIC). Theoretical Computer Science. 593. 1–15.
10.
Kapron, Bruce M., et al.. (2013). Dynamic graph connectivity in polylogarithmic worst case time. 1131–1142. 37 indexed citations
11.
Kapron, Bruce M., et al.. (2013). Dynamic graph connectivity in polylogarithmic worst case time. Symposium on Discrete Algorithms. 1131–1142. 31 indexed citations
12.
Chester, Sean, et al.. (2012). Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Social Network Analysis and Mining. 3(3). 381–399. 32 indexed citations
13.
Chester, Sean, et al.. (2011). k-Anonymization of Social Networks by Vertex Addition.. 107–116. 31 indexed citations
14.
Kapron, Bruce M., David Kempe, Valerie King, Jared Saia, & Vishal Sanwalani. (2008). Fast asynchronous byzantine agreement and leader election with full information. Symposium on Discrete Algorithms. 1038–1047. 10 indexed citations
15.
Impagliazzo, Russell & Bruce M. Kapron. (2005). Logics for reasoning about cryptographic constructions. Journal of Computer and System Sciences. 72(2). 286–320. 28 indexed citations
16.
Kapron, Bruce M. & Stephen Cook. (2002). A new characterization of Mehlhorn's polynomial time functionals. 342–347. 4 indexed citations
17.
Irwin, Robert J., James S. Royer, & Bruce M. Kapron. (2001). On characterizations of the basic feasible functionals, Part I. Journal of Functional Programming. 11(1). 117–153. 15 indexed citations
18.
Gurov, Dilian, et al.. (1997). A modal μ-calculus and a proof system for value passing processes. Electronic Notes in Theoretical Computer Science. 5. 47–47. 2 indexed citations
19.
Fich, Faith E., Russell Impagliazzo, Bruce M. Kapron, Valerie King, & Mirosław Kutyłowski. (1996). Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Journal of Computer and System Sciences. 53(1). 104–111. 2 indexed citations
20.
Halpern, Joseph Y. & Bruce M. Kapron. (1994). Zero-one laws for modal logic. Annals of Pure and Applied Logic. 69(2-3). 157–193. 8 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