Devavrat Shah

Devavrat Shah
Fields Computer Science, Operations Research
Institutions MIT
Alma mater Indian Institute of Technology Bombay
Stanford University
Thesis Randomization and Heavy Traffic Theory: New Approaches for Design and Analysis of Switch Algorithms (2004)
Doctoral advisor Balaji Prabakhar
Known for Mathematical Modelling and Analysis in Computer science and Operations Research

Devavrat Shah is an associate professor in the Electrical Engineering and Computer Science department at MIT.[1] He received a B.Tech. degree in Computer Science from IIT Bombay in 1999 and a Ph.D. in Computer Science from Stanford University in 2004, where his thesis was completed under the supervision of Balaji Prabhakar.

Research

Shah's research focuses on the theory of large complex networks which includes network algorithms, stochastic networks, network information theory and large scale statistical inference. His work has had significant impact both in the development of theoretical tools and in its practical application. This is highlighted by the "Best Paper" awards he has received from top publication venues such as ACM SIGMETRICS and IEEE INFOCOM. Additionally, his work has been recognized by the INFORMS Applied Probability Society via the Erlang Prize, given for outstanding contributions to applied probability by a researcher not more than 9 years from their PhD and the ACM SIGMETRICS Rising Star award, given for outstanding contributions to computer/communication performance evaluation by a research not more than 7 years from their PhD.

Awards

Shah has received many awards, including

References

  1. ↑ "Devavrat Shah".
  2. ↑ https://www.informs.org/Community/APS/APS-Awards-and-Nominations
  3. ↑ http://www.sigmetrics.org/risingstar-2008.shtml


This article is issued from Wikipedia - version of the Tuesday, June 02, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.