Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Brad Karp'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 Brad Karp with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Brad Karp more than expected).
This network shows the impact of papers produced by Brad Karp. 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 Brad Karp. The network helps show where Brad Karp may publish in the future.
Co-authorship network of co-authors of Brad Karp
This figure shows the co-authorship network connecting the top 25 collaborators of Brad Karp.
A scholar is included among the top collaborators of Brad Karp 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 Brad Karp. Brad Karp is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Handley, Mark, et al.. (2014). HACK: hierarchical ACKs for efficient wireless medium utilization. UCL Discovery (University College London). 359–370.11 indexed citations
4.
Yang, Edward Z., et al.. (2013). Toward principled browser security. UCL Discovery (University College London). 17–17.8 indexed citations
5.
Karp, Brad, et al.. (2013). LOUP: the principles and practice of intra-domain route dissemination. UCL Discovery (University College London). 413–426.7 indexed citations
6.
Karp, Brad, et al.. (2010). Structuring protocol implementations to protect sensitive data. UCL Discovery (University College London). 4–4.1 indexed citations
7.
Bittau, Andrea, et al.. (2008). Wedge: splitting applications into reduced-privilege compartments. UCL Discovery (University College London). 309–322.101 indexed citations
8.
Garriss, Scott, Michael Kaminsky, Michael J. Freedman, et al.. (2006). RE: reliable email. Networked Systems Design and Implementation. 22–22.94 indexed citations
9.
Kim, Young-Jin, Ramesh Govindan, Brad Karp, & Scott Shenker. (2005). Geographic routing made practical. Networked Systems Design and Implementation. 217–230.264 indexed citations
Rhea, Sean, Brighten Godfrey, Brad Karp, et al.. (2005). OpenDHT. ACM SIGCOMM Computer Communication Review. 35(4). 73–84.67 indexed citations
12.
Gummadi, R., et al.. (2004). RSR: Reduced-State Routing in the Internet. UCL Discovery (University College London).11 indexed citations
13.
Tolia, Niraj H., Michael A. Kozuch, Mahadev Satyanarayanan, et al.. (2003). Opportunistic Use of Content Addressable Storage for Distributed File Systems. UCL Discovery (University College London). 127–140.82 indexed citations
Ratnasamy, Sylvia, Deborah Estrin, Ramesh Govindan, et al.. (2002). Data-centric storage in Sensornets. Center for Embedded Network Sensing.111 indexed citations
Kung, H. T. & Brad Karp. (2000). Geographic routing for wireless networks.141 indexed citations
20.
Blackwell, Trevor, James Gwertzman, Brad Karp, et al.. (1994). Secure short-cut routing for mobile IP. UCL Discovery (University College London). 21–21.19 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.