Satish Rao
Professor
Info Links
Research Areas
Research Centers
Teaching Schedule
Fall 2023
- CS 61A. The Structure and Interpretation of Computer Programs, MoWeFr 13:00-13:59, Wheeler 150
- CS 70. Discrete Mathematics and Probability Theory, TuTh 09:30-10:59, Pimentel 1
- CS 197-70. Field Study
Selected Publications
- J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in Proc. 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 Proc. 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," J. 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," J. ACM, vol. 46, no. 6, pp. 787-832, Nov. 1999.
- M. W. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas, "Portable and efficient parallel computing using the BSP model," IEEE Trans. Computers, vol. 48, no. 7, pp. 670-689, July 1999.
- S. Rao, "Small distortion and volume preserving embeddings for planar and Euclidean metrics," in Proc. 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," J. ACM, vol. 45, no. 5, pp. 783-797, Sep. 1998.
- I. J. Cox, S. Rao, and Y. Zhong, ""Ratio regions": A technique for image segmentation," in Proc. 13th Intl. Conf. on Pattern Recognition, Vol. 2, Los Alamitos, CA: IEEE Computer Society, 1996, pp. 557-564.
- 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.