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.
BBR: Congestion-Based Congestion Control
2016603 citationsNeal Cardwell, Yuchung Cheng et al.Queueprofile →
BBR
2017567 citationsNeal Cardwell, Yuchung Cheng et al.Communications of the ACMprofile →
A case for intelligent RAM
1997462 citationsDavid A. Patterson, Thomas E. Anderson et al.IEEE Microprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Neal Cardwell'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 Neal Cardwell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neal Cardwell more than expected).
This network shows the impact of papers produced by Neal Cardwell. 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 Neal Cardwell. The network helps show where Neal Cardwell may publish in the future.
Co-authorship network of co-authors of Neal Cardwell
This figure shows the co-authorship network connecting the top 25 collaborators of Neal Cardwell.
A scholar is included among the top collaborators of Neal Cardwell 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 Neal Cardwell. Neal Cardwell is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cheng, Yuchung, et al.. (2000). RACK: a time-based fast loss detection algorithm for TCP.17 indexed citations
13.
Savage, Stefan, Tom Anderson, Amit Aggarwal, et al.. (1999). Detour: a Case for Informed Internet Routing and Transport.30 indexed citations
14.
Wolman, Alec, Geoff Voelker, Nitin Sharma, et al.. (1999). Organization-based analysis of web-object sharing and caching. 3–3.82 indexed citations
15.
Savage, Stefan, Neal Cardwell, David Wetherall, & Tom Anderson. (1999). TCP congestion control with a misbehaving receiver. ACM SIGCOMM Computer Communication Review. 29(5). 71–78.149 indexed citations
Patterson, David A., Thomas E. Anderson, Neal Cardwell, et al.. (1997). A Case for Intelligent RAM: IRAM.112 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.