Satish B. Rao
Satish B. Rao | |
|---|---|
| Education | Massachusetts Institute of Technology (PhD, 1989) |
| Known for |
|
| Awards |
|
| Scientific career | |
| Fields | |
| Workplaces | |
| Frank Thomson Leighton | |
Satish B. Rao is an American computer scientist and professor of computer science at the University of California, Berkeley. His research is in the design and analysis of algorithms, with work in combinatorial optimization, graph partitioning, network flow, metric embeddings, and computational biology.
Rao received the Fulkerson Prize in 2012 with Sanjeev Arora and Umesh Vazirani for their work on approximation algorithms for the sparsest cut problem. He was named an ACM Fellow in 2013 for contributions to algorithms for graph partitioning and for single- and multi-commodity flows.