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.
RSVP: a new resource ReSerVation Protocol
19931.0k citationsDeborah Estrin, Scott Shenker et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Daniel Zappala
Since
Specialization
Citations
This map shows the geographic impact of Daniel Zappala'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 Daniel Zappala with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Zappala more than expected).
This network shows the impact of papers produced by Daniel Zappala. 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 Daniel Zappala. The network helps show where Daniel Zappala may publish in the future.
Co-authorship network of co-authors of Daniel Zappala
This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Zappala.
A scholar is included among the top collaborators of Daniel Zappala 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 Daniel Zappala. Daniel Zappala is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zappala, Daniel, et al.. (2019). "Something isn't secure, but I'm not sure how that translates into a problem": Promoting autonomy by designing for understanding in Signal. Symposium On Usable Privacy and Security. 137–153.5 indexed citations
3.
Zappala, Daniel, et al.. (2018). When is a Tree Really a Truck? Exploring Mental Models of Encryption.. Symposium On Usable Privacy and Security. 395–409.27 indexed citations
4.
Clark, Jeremy, Paul C. van Oorschot, Scott Ruoti, Kent Seamons, & Daniel Zappala. (2018). Securing Email. arXiv (Cornell University).3 indexed citations
5.
O'Neill, Mark, Kent Seamons, & Daniel Zappala. (2018). The Secure Socket API: TLS as an Operating System Service.. USENIX Security Symposium. 43. 799–816.3 indexed citations
6.
O'Neill, Mark, et al.. (2018). Action Needed! Helping Users Find and Complete the Authentication Ceremony in Signal.. Symposium On Usable Privacy and Security. 47–62.6 indexed citations
7.
Ruoti, Scott, et al.. (2018). A Comparative Usability Study of Key Management in Secure Email. Symposium On Usable Privacy and Security. 375–394.10 indexed citations
8.
Hossain, Nahid, Ofir Weisse, R. Sekar, et al.. (2018). Dependence-Preserving Data Compaction for Scalable Forensic Analysis. 1723–1740.40 indexed citations
9.
O'Neill, Mark, et al.. (2017). Is that you, Alice? A Usability Study of the Authentication Ceremony of Secure Messaging Applications. Symposium On Usable Privacy and Security. 29–47.16 indexed citations
10.
Ruoti, Scott, et al.. (2017). Weighing Context and Trade-offs: How Suburban Adults Selected Their Online Security Posture.. Symposium On Usable Privacy and Security. 211–228.26 indexed citations
11.
O'Neill, Mark, et al.. (2017). TrustBase: An Architecture to Repair and Strengthen Certificate-based Authentication. USENIX Security Symposium. 609–624.6 indexed citations
12.
O'Neill, Mark, Scott Ruoti, Kent Seamons, & Daniel Zappala. (2017). TLS Inspection: How Often and Who Cares?. IEEE Internet Computing. 21(3). 22–29.4 indexed citations
13.
O'Neill, Mark, et al.. (2016). Social Authentication for End-to-End Encryption.. Symposium On Usable Privacy and Security.3 indexed citations
GauthierDickey, Chris, Daniel Zappala, & Virginia Lo. (2005). Event Ordering and Congestion Control for Distributed Multiplayer Games.
18.
GauthierDickey, Chris, Daniel Zappala, & Virginia Lo. (2004). Low-Latency and Cheat-proof Event Ordering for Distributed Games.8 indexed citations
19.
Farley, Arthur M., Andrzej Proskurowski, Daniel Zappala, & Kurt Windisch. (2003). Spanners and message distribution in networks. Discrete Applied Mathematics. 137(2). 159–171.19 indexed citations
20.
Zappala, Daniel, Robert Braden, Deborah Estrin, & Scott Shenker. (1997). Interdomain Multicast Routing Support for Integrated Services Networks.4 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.