Biography:Satish Rao
Satish Rao | |
|---|---|
| Alma mater | Massachusetts Institute of Technology (Ph.D., 1989) |
| Occupation | Computer scientist and educator |
| Scientific career | |
| Fields |
|
| Institutions | |
Satish Rao is an American computer scientist who is a professor of computer science at the University of California, Berkeley.[1][2]
Biography
Satish Rao received his PhD from the Massachusetts Institute of Technology in 1989 and joined the faculty at the University of California, Berkeley in 1999.[3]
Research and Awards
Rao's research focuses on computational biology, graph partitioning, and single- and multi-commodity flows (maximum flow problem).[4]
Rao is an ACM Fellow (2013)[5] and won the Fulkerson Prize with Sanjeev Arora and Umesh Vazirani in 2012 for their work on improving the approximation ratio for graph separators and related problems.[6][7] Rao teaches discrete mathematics and probability theory at the University of California, Berkeley.[1]
Publications
Satish Rao has published over 100 publications and is cited frequently.[8]
Selected publications
- S. Arora, S. Rao, and U. Vazirani. "Expander flows, geometric embeddings and graph partitioning," Journal of the ACM (JACM) 56.2 (2009): 1-37.
- J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in Proceedings of 35th Annual ACM Symp. on Theory of Computing, New York, NY: ACM Press, 2003, pp. 448–455.
- K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, "Distributed object location in a dynamic network," in Proceedings of 14th Annual ACM Symp. on Parallel Algorithms and Architectures, New York, NY: ACM Press, 2002, pp. 41–52.
- G. Even, J. S. Naor, S. Rao, and B. Schieber, "Divide-and-conquer approximation algorithms using spreading metrics," Journal of the ACM, vol. 47, no. 4, pp. 585–616, July 2000.
- T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 46, no. 6, pp. 787–832, Nov. 1999.
- S. Rao, "Small distortion and volume preserving embeddings for planar and Euclidean metrics," in Proceedings of 15th Annual Symp. on Computational Geometry, New York, NY: ACM Press, 1999, pp. 300–306.
- A. V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," Journal of the ACM, vol. 45, no. 5, pp. 783–797, Sep. 1998.
- J. Ingemar Cox, S. L. Hingorani, S. Rao and B. M. Maggs. "A maximum likelihood stereo algorithm," Computer vision and image understanding 63, no. 3 (1996): 542-567.
- F. T. Leighton, B. M. Maggs, and S. Rao, "Packet routing and job-shop scheduling in O(congestion + dilation) steps," Combinatorica, vol. 14, no. 2, pp. 167–186, June 1994.
References
- ↑ 1.0 1.1 "Satish Rao | EECS at UC Berkeley". University of California, Berkeley. https://www2.eecs.berkeley.edu/Faculty/Homepages/rao.html.
- ↑ "Envisioning safer cities with AI" (in en). https://eurekalert.org/pub_releases/2021-05/uota-esc051921.php.
- ↑ "Satish Rao | Simons Institute for the Theory of Computing". 22 May 2013. https://simons.berkeley.edu/people/satish-rao.
- ↑ "Satish Rao" (in en). Association for Computing Machinery. https://awards.acm.org/award_winners/rao_9569625.
- ↑ "Fellow Recipients" (in en). Association for Computing Machinery. https://awards.acm.org/fellows/award-winners.
- ↑ "Congratulations to Professor Arora winner of the Fulkerson Prize | Computer Science Department at Princeton University". https://www.cs.princeton.edu/news/article/congratulations-professor-arora-winner-fulkerson-prize.
- ↑ "Browse Prizes and Awards" (in en). http://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=17.
- ↑ "Satish B Rao". https://scholar.google.com/citations?user=62Uqu6wAAAAJ&hl=en.
External links
 |
