Satish B. Rao is an American computer scientist who is a professor of

computer science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...

at the

University of California, Berkeley The University of California, Berkeley (UC Berkeley, Berkeley, Cal, or California), is a Public university, public Land-grant university, land-grant research university in Berkeley, California, United States. Founded in 1868 and named after t ...

Biography

Satish Rao received his PhD from the

Massachusetts Institute of Technology The Massachusetts Institute of Technology (MIT) is a Private university, private research university in Cambridge, Massachusetts, United States. Established in 1861, MIT has played a significant role in the development of many areas of moder ...

in 1989 and joined the faculty at the University of California, Berkeley in 1999.

Research and awards

Rao's research focuses on

computational biology Computational biology refers to the use of techniques in computer science, data analysis, mathematical modeling and Computer simulation, computational simulations to understand biological systems and relationships. An intersection of computer sci ...

graph partitioning In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges of the original graph that cross between the groups will produce edges in the partitioned graph ...

, and single- and multi-commodity flows (

maximum flow problem In Optimization (mathematics), optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex ...

). Rao is an ACM Fellow (2013) and won the

Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e ...

with

Sanjeev Arora Sanjeev Arora (born January 1968) is an Indian-American theoretical computer scientist who works in AI and Machine learning. Life Sanjeev scored the IIT JEE number 1 rank in 1986 He was a visiting scholar at the Institute for Advanced Study in ...

and

Umesh Vazirani Umesh Virkumar Vazirani is an Indian–American academic who is the Roger A. Strauch Professor of Electrical Engineering and Computer Science at the University of California, Berkeley, and the director of the Berkeley Quantum Computation Center. ...

in 2012 for their work on improving the

approximation ratio In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned sol ...

for graph separators and related problems from

O(\log n)

O(\sqrt)

. Rao teaches

discrete mathematics Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous f ...

and

probability theory Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expre ...

at the University of California, Berkeley.

Publications

Satish Rao has published over 100 publications and is cited frequently.

Selected publications

* S. Arora, S. Rao, and U. Vazirani. "Expander flows, geometric embeddings and graph partitioning," ''

Journal of the ACM The ''Journal of the ACM'' (''JACM'') is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is ...

(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,"

, 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,"

, 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,"

, 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

External links

*
Satish Rao's Homepage at UC Berkeley
2013 fellows of the Association for Computing Machinery Living people American computer scientists Indian computer scientists Year of birth missing (living people) {{Scientist-stub