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.
Distributed Detection of Node Replication Attacks in Sensor Networks
2005448 citationsBryan Parno, Adrian Perrig et al.profile →
Flicker
2008427 citationsJonathan M. McCune, Bryan Parno et al.profile →
This map shows the geographic impact of Bryan Parno'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 Bryan Parno with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bryan Parno more than expected).
This network shows the impact of papers produced by Bryan Parno. 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 Bryan Parno. The network helps show where Bryan Parno may publish in the future.
Co-authorship network of co-authors of Bryan Parno
This figure shows the co-authorship network connecting the top 25 collaborators of Bryan Parno.
A scholar is included among the top collaborators of Bryan Parno 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 Bryan Parno. Bryan Parno is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Heule, Marijn J. H., et al.. (2021). Finding Invariants of Distributed Systems: It's a Small (Enough) World After All.. Networked Systems Design and Implementation. 115–131.2 indexed citations
8.
Liu, Guyue, et al.. (2021). Don't Yank My Chain: Auditable {NF} Service Chaining. Networked Systems Design and Implementation. 155–173.2 indexed citations
Hawblitzel, Chris, Manos Kapritsos, K. Rustan M. Leino, et al.. (2017). Vale: Verifying High-Performance Cryptographic Assembly Code. USENIX Security Symposium. 917–934.31 indexed citations
11.
Ferraiuolo, Andrew, Andrew Baumann, Chris Hawblitzel, & Bryan Parno. (2017). Komodo. 287–305.90 indexed citations
12.
Howell, Jon, Jeremy Elson, Bryan Parno, & John R. Douceur. (2014). Missive: Fast Application Launch From an Untrusted Buffer Cache. USENIX Annual Technical Conference. 145–156.1 indexed citations
Howell, Jon, Bryan Parno, & John R. Douceur. (2013). Embassies: radically refactoring the web. Networked Systems Design and Implementation. 529–546.22 indexed citations
16.
Howell, Jon, Bryan Parno, & John R. Douceur. (2013). How to run POSIX apps in a minimal picoprocess. USENIX Annual Technical Conference. 321–332.15 indexed citations
Parno, Bryan. (2008). Bootstrapping trust in a trusted platform. USENIX Security Symposium. 9.72 indexed citations
20.
McCune, Jonathan M., Bryan Parno, Adrian Perrig, Michael K. Reiter, & Arvind Seshadri. (2008). How low can you go?. ACM SIGPLAN Notices. 43(3). 14–25.1 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.