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.
Algorand
2017778 citationsSilvio Micali, Georgios Vlachos et al.DSpace@MIT (Massachusetts Institute of Technology)profile →
CryptDB
2011687 citationsRaluca Ada Popa, Nickolai Zeldovich et al.DSpace@MIT (Massachusetts Institute of Technology)profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Nickolai Zeldovich
Since
Specialization
Citations
This map shows the geographic impact of Nickolai Zeldovich'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 Nickolai Zeldovich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nickolai Zeldovich more than expected).
Fields of papers citing papers by Nickolai Zeldovich
This network shows the impact of papers produced by Nickolai Zeldovich. 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 Nickolai Zeldovich. The network helps show where Nickolai Zeldovich may publish in the future.
Co-authorship network of co-authors of Nickolai Zeldovich
This figure shows the co-authorship network connecting the top 25 collaborators of Nickolai Zeldovich.
A scholar is included among the top collaborators of Nickolai Zeldovich 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 Nickolai Zeldovich. Nickolai Zeldovich is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Athalye, Anish, Adam Belay, M. Frans Kaashoek, Robert Tappan Morris, & Nickolai Zeldovich. (2020). Notary: A Device for Secure Transaction Approval.. DSpace@MIT (Massachusetts Institute of Technology). 45.2 indexed citations
Chen, Haogang, Daniel Ziegler, Tej Chajed, et al.. (2016). Using Crash Hoare Logic for Certifying the {FSCQ} File System. DSpace@MIT (Massachusetts Institute of Technology).1 indexed citations
Zhivich, Michael, et al.. (2011). Experiences in cyber security education: the MIT Lincoln laboratory capture-the-flag exercise. USENIX Security Symposium. 12–12.35 indexed citations
13.
Boyd-Wickizer, Silas & Nickolai Zeldovich. (2010). Tolerating malicious device drivers in Linux. DSpace@MIT (Massachusetts Institute of Technology). 9–9.66 indexed citations
14.
Chandra, Ramesh, Priya Gupta, & Nickolai Zeldovich. (2010). Separating web applications from user data storage with BSTORE. DSpace@MIT (Massachusetts Institute of Technology). 1–1.12 indexed citations
15.
Boyd-Wickizer, Silas, Austin T. Clements, Yandong Mao, et al.. (2010). An analysis of Linux scalability to many cores. Operating Systems Design and Implementation. 1–16.245 indexed citations
16.
Kim, Taesoo & Nickolai Zeldovich. (2010). Making Linux protection mechanisms egalitarian with UserFS. DSpace@MIT (Massachusetts Institute of Technology). 2–2.10 indexed citations
17.
Zeldovich, Nickolai, Silas Boyd-Wickizer, & David Mazières. (2008). Securing distributed systems with information flow control. Networked Systems Design and Implementation. 293–308.132 indexed citations
Zeldovich, Nickolai, Alexander Yip, Frank Dabek, et al.. (2003). Multiprocessor Support for Event-Driven Programs.. USENIX Annual Technical Conference. 239–252.42 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.