Devavrat Shah

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

Devavrat Shah is a professor in the Electrical Engineering and Computer Science department at MIT. [1] He is director of the Statistics and Data Science Center at MIT. 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.

Contents

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, IEEE INFOCOM and NIPS. 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. He is a young distinguished alumnus of his alma mater IIT Bombay.

Awards

Shah has received many awards, including

Industry

Shah co-founded Celect, Inc. [4] in 2013.

Related Research Articles

Donald Fred Towsley is an American computer scientist who has been a distinguished university professor in the College of Information and Computer Sciences at the University of Massachusetts Amherst.

George Varghese is a Principal Researcher at Microsoft Research. Before joining MSR's lab in Silicon Valley in 2013, he was a Professor of Computer Science at the University of California San Diego, where he led the Internet Algorithms Lab and also worked with the Center for Network Systems and the Center for Internet Epidemiology. He is the author of the textbook Network Algorithmics published by Morgan Kaufmann in 2004.

SIGMETRICS is the Association for Computing Machinery's Special Interest Group on Measurement and Evaluation, which specializes in the field of performance analysis, measurement, and modeling of computer systems. It is also the name of an annual 'flagship' conference, organized by SIGMETRICS since 1973, which is considered to be the leading conference in performance analysis and modeling in the world. Known to have an extremely competitive acceptance rate (~15%), many of the landmark works in the area have been published through it.

John Chi-Shing Lui is a Hong Kong computer scientist. He was the chairman of the Department of Computer Science & Engineering in the Chinese University of Hong Kong. He received his Ph.D. in Computer Science from UCLA. When he was a Ph.D student at UCLA, he spent a summer working in IBM's Thomas J. Watson Research Center. After his graduation, he joined the IBM Almaden Research Laboratory/San Jose Laboratory and participated in various research and development projects on file systems and parallel I/O architectures. He later joined the Department of Computer Science and Engineering at the Chinese University of Hong Kong. For the past several summers, he has been a visiting professor in computer science departments at UCLA, Columbia University, University of Maryland at College Park, Purdue University, University of Massachusetts Amherst and Universita' degli Studi di Torino in Italy.

Arvind is the Johnson Professor of Computer Science and Engineering in the Computer Science and Artificial Intelligence Laboratory (CSAIL) at the Massachusetts Institute of Technology (MIT). He is a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) and the Association for Computing Machinery (ACM). He was also elected as a member into the National Academy of Engineering in 2008 for contributions to data flow and multi-thread computing and the development of tools for the high-level synthesis of hardware.

The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society.

<span class="mw-page-title-main">Constantinos Daskalakis</span> Greek computer scientist

Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.

Michael David Mitzenmacher is an American computer scientist working in algorithms. He is Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences and was area dean of computer science July 2010 to June 2013. He also runs My Biased Coin, a blog about theoretical computer science.

In queueing theory, a loss network is a stochastic model of a telephony network in which calls are routed around a network between nodes. The links between nodes have finite capacity and thus some calls arriving may find no route available to their destination. These calls are lost from the network, hence the name loss networks.

<span class="mw-page-title-main">Adam Wierman</span>

Adam Wierman is Professor of Computer Science in the Department of Computing and Mathematical Sciences at the California Institute of Technology. He is known for his work on scheduling (computing), heavy tails, green computing, queueing theory, and algorithmic game theory.

Jean Camille Walrand is a professor of Computer Science at UC Berkeley. He received his Ph.D. from the Department of Electrical Engineering and Computer Sciences department at the University of California, Berkeley, and has been on the faculty of that department since 1982. He is the author of "An Introduction to Queueing Networks", "Communication Networks: A First Course", "Probability in Electrical Engineering and Computer Sciences: An Application-Driven Course", and "Uncertainty: A User Guide", and co-author of "High-Performance Communication Networks", "Communication Networks: A Concise Introduction", "Scheduling and Congestion Control for Communication and Processing networks", and "Sharing Network Resources". His research interests include stochastic processes, queuing theory, communication networks, game theory, and the economics of the Internet.

Alexandre Proutiere is a professor of Electrical Engineering at KTH, the Royal Institute of Technology. He received an engineering degree from Ecole Nationale Superieure des Telecoms (Paris) and then, from 1998 to 2000, he worked in the radio communication department at the Ministry of Foreign Affairs in Paris. He received his PhD in Applied Mathematics from Ecole Polytechnique, Palaiseau, France in 2003 under the supervision of James Roberts. Following his PhD he worked as a researcher at Microsoft Research in Cambridge (UK) before joining KTH as an associate professor.

Milan Vojnovic is a professor of data science with the Department of Statistics at the London School of Economics, where he is also director of the MSc Data Science Programme. Prior to this, he worked as a researcher with Microsoft Research from 2004 to 2016.

Dimitris Bertsimas is an American applied mathematician, and a professor in the Sloan School of Management at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts.

<span class="mw-page-title-main">Bruce Hajek</span> American electrical engineer

Bruce Edward Hajek is a Professor in the Coordinated Science Laboratory, the head of the Department of Electrical and Computer Engineering, and the Leonard C. and Mary Lou Hoeft Chair in Engineering at the University of Illinois at Urbana-Champaign. He does research in communication networking, auction theory, stochastic analysis, combinatorial optimization, machine learning, information theory, and bioinformatics.

Mark Crovella is an American computer scientist and Professor at Boston University. His research focuses on computer networks as well as data science. Much of his work has focused on improving the understanding, design, and performance of parallel and networked computer systems, mainly through the application of measurement, data mining, statistics, and performance evaluation. In the computer science arena, he has focused on the analysis of social, biological, and communication networks. He is co-author of the first text on Internet Measurement, Internet Measurement: Infrastructure, Traffic, and Applications. In 2010 he was one of the inaugural winners of the ACM SIGMETRICS Test of Time awards, which recognize "an influential performance evaluation paper whose impact is still felt 10-12 years after its initial publication." He was named ACM Fellow in 2010, and Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2012, in both cases for contributions to the measurement and analysis of networks and distributed systems. He served as chair of ACM SIGCOMM from 2007 to 2009, and he served as Chair of the Department of Computer Science at Boston University from 2013 to 2018.

Mor Harchol-Balter is the Bruce J. Nelson Professor of Computer Science at Carnegie Mellon University. She is known for her work on queueing theory, scheduling and resource allocation, load balancing, data center power management, and heavy-tailed workloads.

<span class="mw-page-title-main">Moustafa Youssef</span> Egyptian computer scientist

Moustafa Youssef is an Egyptian computer scientist who was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2019 for contributions to wireless location tracking technologies and a Fellow of the Association of Computing Machinery (ACM) in 2019 for contributions to location tracking algorithms. He is the first and only ACM Fellow in the Middle East and Africa.

Amber Lynn Puha is an American mathematician and educator at California State University San Marcos. Her research concerns probability theory and stochastic processes.

Can Emre Koksal is an electrical engineer, computer scientist, academic, and entrepreneur. He is the Founder and CEO of Datanchor, and a Professor of Electrical and Computer Engineering at The Ohio State University.

References

  1. "Devavrat Shah". Mit.edu. Retrieved 7 November 2017.
  2. "APS Awards and Nominations / APS / Community / IOL Home - INFORMS.org". Archived from the original on 2013-02-01. Retrieved 2013-08-07.
  3. "ACM SIGMETRICS". Sigmetrics.org. Retrieved 7 November 2017.
  4. Inc., Celect. "Inventory Optimization for Retail - Predictive Analytics". Celect.com. Retrieved 7 November 2017.