Satish Rao

Satish B. Rao is an American computer scientist and a professor of computer science at the University of California, Berkeley. His research concerns the design and analysis of algorithms, with work in combinatorial optimization, graph partitioning, network flow, metric embeddings and computational biology. He received the Fulkerson Prize in 2012, shared with Sanjeev Arora and Umesh Vazirani, for their work on approximation algorithms for the sparsest cut problem, and he was named a Fellow of the Association for Computing Machinery in 2013 for contributions to algorithms for graph partitioning and for single and multi commodity flows. He earned his doctorate at the Massachusetts Institute of Technology in 1989, and worked at NEC Laboratories before joining the Berkeley faculty.