View source for Biography:Satish Rao

{{short description|American computer scientist and educator}}
{{Infobox person
| name               = Satish Rao
| image              = 
| caption            = 
| birth_date         = 
| alma mater         = [[Organization:Massachusetts Institute of Technology|Massachusetts Institute of Technology]] (Ph.D., 1989)
| birth_place        = 
| death_date         = 
| death_place        = 
| occupation         = Computer scientist and educator
| networth           = 
| spouse             = 
| website            = 
| footnotes          = 
| children           = 
| module             = {{Infobox scientist
| embed              = yes
| work_institutions  = {{hlist|[[Organization:University of California, Berkeley|University of California, Berkeley]]}}
| fields             =  {{hlist|[[Biology:Computational biology|Computational biology]]|Graph partitioning|[[Maximum flow problem]]}}
}}
}}

'''Satish Rao''' is an American computer scientist who is a professor of [[Computer science|computer science]] at the [[Organization:University of California, Berkeley|University of California, Berkeley]].<ref name=":0">{{Cite web|title=Satish Rao {{!}} EECS at UC Berkeley|url=https://www2.eecs.berkeley.edu/Faculty/Homepages/rao.html|url-status=live|access-date=2021-06-02|website=www2.eecs.berkeley.edu|publisher=[[Organization:University of California, Berkeley|University of California, Berkeley]]}}</ref><ref>{{Cite web|title=Envisioning safer cities with AI|url=https://eurekalert.org/pub_releases/2021-05/uota-esc051921.php|access-date=2021-06-02|website=EurekAlert!|language=en}}</ref>

== Biography ==
Satish Rao received his PhD from the [[Organization:Massachusetts Institute of Technology|Massachusetts Institute of Technology]] in 1989 and joined the faculty at the University of California, Berkeley in 1999.<ref>{{Cite web|title=Satish Rao {{!}} Simons Institute for the Theory of Computing|url=https://simons.berkeley.edu/people/satish-rao|access-date=2021-06-02|website=simons.berkeley.edu|date=22 May 2013 }}</ref> 

== Research and Awards ==
Rao's research focuses on [[Biology:Computational biology|computational biology]], graph partitioning, and single- and multi-commodity flows ([[Maximum flow problem|maximum flow problem]]).<ref>{{Cite web|title=Satish Rao|url=https://awards.acm.org/award_winners/rao_9569625|url-status=live|access-date=2021-06-02|website=awards.acm.org|publisher=[[Organization:Association for Computing Machinery|Association for Computing Machinery]]|language=en}}</ref> 

Rao is an [[Organization:Association for Computing Machinery|ACM]] Fellow (2013)<ref>{{Cite web|title=Fellow Recipients|url=https://awards.acm.org/fellows/award-winners|access-date=2021-06-02|website=awards.acm.org|publisher=[[Organization:Association for Computing Machinery|Association for Computing Machinery]]|language=en}}</ref> and won the Fulkerson Prize with [[Biography:Sanjeev Arora|Sanjeev Arora]] and [[Biography:Umesh Vazirani|Umesh Vazirani]] in 2012 for their work on improving the approximation ratio for graph separators and related problems.<ref>{{Cite web|title=Congratulations to Professor Arora winner of the Fulkerson Prize {{!}} Computer Science Department at Princeton University|url=https://www.cs.princeton.edu/news/article/congratulations-professor-arora-winner-fulkerson-prize|access-date=2021-06-02|website=www.cs.princeton.edu}}</ref><ref>{{Cite web|title=Browse Prizes and Awards|url=http://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=17|access-date=2021-06-02|website=American Mathematical Society|language=en}}</ref> Rao teaches [[Discrete mathematics|discrete mathematics]] and [[Probability theory|probability theory]] at the University of California, Berkeley.<ref name=":0" />

== Publications ==
Satish Rao has published over 100 publications and is cited frequently.<ref>{{Cite web|title=Satish B Rao|url=https://scholar.google.com/citations?user=62Uqu6wAAAAJ&hl=en|access-date=2021-06-02|website=scholar.google.com}}</ref>

=== 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.&nbsp;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.&nbsp;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.&nbsp;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.&nbsp;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.&nbsp;300–306.
* A. V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," [[Journal of the ACM]], vol. 45, no. 5, pp.&nbsp;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.&nbsp;167–186, June 1994.

== References ==
<references />

== External links ==
* [https://scholar.google.com/citations?user=62Uqu6wAAAAJ&hl=en Google Scholar profile]

[[Category:American computer scientists]]



{{Sourceattribution|Satish Rao|1}}