Devavrat D. Shah, Ph.D.
Affiliations: | Massachusetts Institute of Technology, Cambridge, MA, United States | ||
2005 | Stanford University, Palo Alto, CA |
Area:
Computer ScienceGoogle:
"Devavrat Shah"Bio:
Parents
Sign in to add mentorBalaji Prabhakar | grad student | 2005 | Stanford | |
(Randomization and heavy traffic theory: New approaches to the design and analysis of switch algorithms.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Li Y, Shah D, Song D, et al. (2020) Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model Ieee Transactions On Information Theory. 66: 1760-1784 |
Jung K, Lu Y, Shah D, et al. (2019) Revisiting Stochastic Loss Networks: Structures and Approximations Mathematics of Operations Research. 44: 890-918 |
Bresler G, Gamarnik D, Shah D. (2018) Learning Graphical Models From the Glauber Dynamics Ieee Transactions On Information Theory. 64: 4072-4080 |
Negahban S, Oh S, Shah D. (2017) Rank Centrality: Ranking from Pairwise Comparisons Operations Research. 65: 266-287 |
Sundararajan JK, Shah D, Medard M, et al. (2017) Feedback-Based Online Network Coding Ieee Transactions On Information Theory. 63: 6628-6649 |
Shah D, Zaman TR. (2016) Finding Rumor Sources on Random Trees Operations Research. 64: 736-755 |
Karger DR, Oh S, Shah D. (2014) Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems Operations Research. 62: 1-24 |
Shah D, Walton NS, Zhong YJ. (2014) Optimal queue-size scaling in switched networks Annals of Applied Probability. 24: 2207-2245 |
Shah D, Tsitsiklis JN, Hong YZ. (2014) Qualitative properties of α-fair policies in bandwidth-sharing networks Annals of Applied Probability. 24: 76-113 |
Gamarnik D, Shah D, Wei Y. (2012) Belief Propagation for Min-Cost Network Flow: Convergence and Correctness Operations Research. 60: 410-428 |