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 Ken Birman'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 Ken Birman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ken Birman more than expected).
This network shows the impact of papers produced by Ken Birman. 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 Ken Birman. The network helps show where Ken Birman may publish in the future.
Co-authorship network of co-authors of Ken Birman
This figure shows the co-authorship network connecting the top 25 collaborators of Ken Birman.
A scholar is included among the top collaborators of Ken Birman 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 Ken Birman. Ken Birman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Weatherspoon, Hakim, et al.. (2009). Smoke and mirrors: reflecting files at a geographically remote location without loss of performance. File and Storage Technologies. 211–224.11 indexed citations
6.
Balakrishnan, Mahesh, et al.. (2008). Maelstrom: transparent error correction for lambda networks. Networked Systems Design and Implementation. 263–278.14 indexed citations
7.
Balakrishnan, Mahesh, Ken Birman, Amar Phanishayee, & Stefan Pleisch. (2007). Ricochet: lateral error correction for time-critical multicast. Networked Systems Design and Implementation. 6–6.22 indexed citations
8.
Ostrowski, K, Ken Birman, & Danny Dolev. (2007). QuickSilver Scalable Multicast. eCommons (Cornell University).5 indexed citations
Gupta, Indranil, et al.. (2003). Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. Lecture notes in computer science. 2735. 160–169.2 indexed citations
Rodeh, Ohad, Ken Birman, & Danny Dolev. (2000). Optimized Rekey for Group Communication Systems.. Network and Distributed System Security Symposium.20 indexed citations
17.
Rodeh, Ohad, Ken Birman, & Danny Dolev. (2000). The Architecture and Performance of Security Protocols in the Ensemble Group Communication System - Using Diamonds to Guard the Castle.18 indexed citations
18.
Cho, Kenjiro & Ken Birman. (1994). A Group Communication Approach for Mobile Computing MobileChannel: an ISIS Tool for Mobile Services. eCommons (Cornell University). 95. 20306.11 indexed citations
Rowe, Lawrence A. & Ken Birman. (1979). Network Support for a Distributed Data Base System.. 337.9 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.