World's Best Scientists 2026 revealed!
Devavrat Shah

Devavrat Shah

D-Index & Metrics

Computer Science

D-Index
72
Citations
21557
World Ranking
1671
National Ranking
857

Overview

Devavrat Shah is affiliated with MIT in the United States and is engaged in research primarily within the fields of Computer Science and Mathematics. Their work spans subfields including Artificial Intelligence, Statistics and Probability, Management Science and Operations Research, Computational Mechanics, and Modeling and Simulation.

The research topics covered by Shah include a variety of specialized areas such as Statistical Methods and Inference, Sparse and Compressive Sensing Techniques, Advanced Causal Inference Techniques, Stochastic Gradient Optimization Techniques, Reinforcement Learning in Robotics, COVID-19 epidemiological studies, and Advanced Bandit Algorithms Research.

Frequent publication venues for Shah include:

  • arXiv (Cornell University)
  • Blood
  • ACM SIGMETRICS Performance Evaluation Review
  • IEEE Transactions on Information Theory
  • Operations Research

Shah has collaborated extensively with a number of coauthors, indicating ongoing research partnerships. Notable frequent coauthors are:

  • Ali Jadbabaie
  • Dennis Shen
  • Anish Agarwal
  • Mark N Sorial
  • Salvia Jain

Some recent papers authored or coauthored by Devavrat Shah include:

  • Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation, 2020, arXiv (Cornell University)
  • Iterative Collaborative Filtering for Sparse Matrix Estimation, 2021, Operations Research
  • Federated Optimization of Smooth Loss Functions, 2023, IEEE Transactions on Information Theory
  • Causal Matrix Completion, 2021, arXiv (Cornell University)
  • On Multivariate Singular Spectrum Analysis and Its Variants, 2022, ACM SIGMETRICS Performance Evaluation Review

Best Publications

  • Randomized gossip algorithms

    Stephen Boyd;Arpita Ghosh;Balaji Prabhakar;Devavrat Shah

  • Throughput-delay trade-off in wireless networks

    A.El. Gamal;J. Mammen;B. Prabhakar;D. Shah

  • Rumors in a Network: Who's the Culprit?

    D. Shah;T. Zaman

  • Gossip algorithms: design, analysis and applications

    S. Boyd;A. Ghosh;B. Prabhakar;D. Shah

  • Iterative Learning for Reliable Crowdsourcing Systems

    David R. Karger;Sewoong Oh;Devavrat Shah

  • Fastpass: a centralized "zero-queue" datacenter network

    Jonathan Perry;Amy Ousterhout;Hari Balakrishnan;Devavrat Shah

  • Optimal throughput-delay scaling in wireless networks: part I: the fluid model

    Abbas El Gamal;James Mammen;Balaji Prabhakar;Devavrat Shah

  • Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

    David R. Karger;Sewoong Oh;Devavrat Shah

  • Turbo-charging vertical mining of large databases

    Pradeep Shenoy;Jayant R. Haritsa;S. Sudarshan;Gaurav Bhalotia

  • A Nonparametric Approach to Modeling Choice with Limited Data

    Vivek F. Farias;Srikanth Jagabathula;Devavrat Shah

  • Maximizing throughput in wireless networks via gossiping

    Eytan Modiano;Devavrat Shah;Gil Zussman

  • Network Coding Meets TCP: Theory and Implementation

    Jay Kumar Sundararajan;Devavrat Shah;Muriel Médard;Szymon Jakubczak

  • Network Coding Meets TCP

    J. K. Sundararajan;D. Shah;M. Medard;M. Mitzenmacher

  • Adaptive Alternating Minimization Algorithms

    U. Niesen;D. Shah;G.W. Wornell

  • ARQ for network coding

    J. Kumar Sundararajan;D. Shah;M. Medard

  • Fast updating algorithms for TCAM

    D. Shah;P. Gupta

  • Gossip Algorithms

    Devavrat Shah

  • Detecting sources of computer viruses in networks: theory and experiment

    Devavrat Shah;Tauhid Zaman

  • Network adiabatic theorem: an efficient randomized protocol for contention resolution

    Shreevatsa Rajagopalan;Devavrat Shah;Jinwoo Shin

  • Computing separable functions via gossip

    Damon Mosk-Aoyama;Devavrat Shah

Frequent Co-Authors

Balaji Prabhakar
Balaji Prabhakar Stanford University
Jinwoo Shin
Jinwoo Shin Korea Advanced Institute of Science and Technology
Paolo Giaccone
Paolo Giaccone Polytechnic University of Turin
Sewoong Oh
Sewoong Oh University of Washington

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a range of related online degrees and career pathways in technology and science. Many students are seeking flexible, cost-effective options to advance their education and achieve their career goals.

For those looking to accelerate their studies, a 1 year computer science degree online can offer a fast-track route to the tech industry with high academic rigor. If affordability is your top priority, consider the cheapest online environmental science degree or an online degree in mechanical engineering, both excellent for students interested in STEM but mindful of tuition costs.

Science and engineering fields also intersect with computer science. Earning a physics degree online can strengthen your analytical and problem-solving abilities—highly valued in high-tech and research-oriented careers. Each of these online degree options provides the flexibility, affordability, and quality needed to start or advance your journey in the sciences or engineering.

Best Scientists Citing Devavrat Shah

Trending Scientists

Recently Published Articles