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.
Randomized gossip algorithms
20061.6k citationsDevavrat Shah et al.IEEE Transactions on Information Theoryprofile →
This map shows the geographic impact of Devavrat Shah'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 Devavrat Shah with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Devavrat Shah more than expected).
This network shows the impact of papers produced by Devavrat Shah. 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 Devavrat Shah. The network helps show where Devavrat Shah may publish in the future.
Co-authorship network of co-authors of Devavrat Shah
This figure shows the co-authorship network connecting the top 25 collaborators of Devavrat Shah.
A scholar is included among the top collaborators of Devavrat Shah 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 Devavrat Shah. Devavrat Shah is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Jadbabaie, Ali, et al.. (2024). Estimation of Skill Distributions. IEEE Transactions on Information Theory. 70(9). 6447–6480.1 indexed citations
Shah, Devavrat, et al.. (2021). Change Point Detection via Multivariate Singular Spectrum Analysis. Neural Information Processing Systems. 34.3 indexed citations
5.
Agarwal, Anish, et al.. (2018). Time Series Analysis via Matrix Estimation.. arXiv (Cornell University).1 indexed citations
6.
Borgs, Christian, Jennifer Chayes, Christina Lee, & Devavrat Shah. (2017). Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation. Neural Information Processing Systems. 30. 4715–4726.9 indexed citations
7.
Perry, Jonathan, Hari Balakrishnan, & Devavrat Shah. (2017). Flowtune: flowlet control for datacenter networks. DSpace@MIT (Massachusetts Institute of Technology). 421–435.44 indexed citations
8.
Lee, Christina, et al.. (2016). Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering. DSpace@MIT (Massachusetts Institute of Technology). 29. 2155–2163.13 indexed citations
9.
Shah, Devavrat, et al.. (2016). Trading Bitcoin and Online Time Series Prediction. Neural Information Processing Systems. 1–15.35 indexed citations
10.
Farias, Vivek F., Srikanth Jagabathula, & Devavrat Shah. (2009). A Data-Driven Approach to Modeling Choice. DSpace@MIT (Massachusetts Institute of Technology). 22. 504–512.11 indexed citations
11.
Farias, Vivek F., Srikanth Jagabathula, & Devavrat Shah. (2009). A New Approach to Modeling Choice with Limited Data. arXiv (Cornell University).10 indexed citations
12.
Jung, Kyomin, Pushmeet Kohli, & Devavrat Shah. (2009). Local Rules for Global MAP: When Do They Work ?. DSpace@MIT (Massachusetts Institute of Technology). 22. 871–879.5 indexed citations
Shah, Devavrat & John N. Tsitsiklis. (2008). Bin Packing with Queues. Journal of Applied Probability. 45(4). 922–939.9 indexed citations
15.
Shah, Devavrat & John N. Tsitsiklis. (2008). Bin Packing with Queues. Journal of Applied Probability. 45(4). 922–939.1 indexed citations
16.
Niesen, Urs, Piyush Gupta, & Devavrat Shah. (2008). The Unicast and Multicast Capacity Regions of Large Wireless Networks. arXiv (Cornell University).2 indexed citations
17.
Shah, Devavrat, et al.. (2007). Fundamental Performance Limits for Multi-Stage Vehicle Routing Problems. 43(2). 117–8.5 indexed citations
Shah, Devavrat. (2005). Max Product for Max-Weight Independent Set and Matching. arXiv (Cornell University).2 indexed citations
20.
Shah, Devavrat, et al.. (1999). Interestingness and Pruning of Mined Patterns.. International Conference on Management of Data.33 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.