Satish B Rao
Satish B Rao
Unknown affiliation
Verified email at berkeley.edu
TitleCited byYear
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
T Leighton, S Rao
Journal of the ACM (JACM) 46 (6), 787-832, 1999
8291999
Expander flows, geometric embeddings and graph partitioning
S Arora, S Rao, U Vazirani
Journal of the ACM (JACM) 56 (2), 5, 2009
7822009
A tight bound on approximating arbitrary metrics by tree metrics
J Fakcharoenphol, S Rao, K Talwar
Journal of Computer and System Sciences 69 (3), 485-497, 2004
7692004
A maximum likelihood stereo algorithm
IJ Cox, SL Hingorani, SB Rao, BM Maggs
Computer vision and image understanding 63 (3), 542-567, 1996
6901996
Optimal route selection in a content delivery network
CF Bornstein, TK Canfield, GL Miller, SB Rao, R Sundaram
US Patent 7,274,658, 2007
626*2007
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
T Leighton, S Rao
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988
5831988
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
5261998
BSPlib: The BSP programming library
JMD Hill, B McColl, DC Stefanescu, MW Goudreau, K Lang, SB Rao, ...
Parallel Computing 24 (14), 1947-1980, 1998
4831998
Distributed object location in a dynamic network
K Hildrum, JD Kubiatowicz, S Rao, BY Zhao
Theory of Computing Systems 37 (3), 405-440, 2004
4702004
Method for caching and delivery of compressed content in a content delivery network
MM Afergan, C Schlossberg, DP Hong, SB Rao
US Patent 7,395,355, 2008
4602008
Faster shortest-path algorithms for planar graphs
MR Henzinger, P Klein, S Rao, S Subramanian
journal of computer and system sciences 55 (1), 3-23, 1997
4241997
Approximation Schemes for Euclidean k-Medians and Related Problems.
S Arora, P Raghavan, S Rao
STOC 98, 106-113, 1998
4171998
Packet routing and job-shop scheduling ino (congestion+ dilation) steps
FT Leighton, BM Maggs, SB Rao
Combinatorica 14 (2), 167-186, 1994
3281994
Divide-and-conquer approximation algorithms via spreading metrics
G Even, JS Naor, S Rao, S Rao, B Schieber
Journal of the ACM (JACM) 47 (4), 585-616, 2000
2522000
A faster deterministic maximum flow algorithm
V King, S Rao, R Tarjan
Journal of Algorithms 17 (3), 447-474, 1994
2211994
Excluded minors, network decomposition, and multicommodity flow
P Klein, SA Plotkin, S Rao
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2141993
Universal packet routing algorithms
T Leighton, B Maggs, S Rao
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988
2021988
Antidote: understanding and defending against poisoning of anomaly detectors
BIP Rubinstein, B Nelson, L Huang, AD Joseph, S Lau, S Rao, N Taft, ...
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement, 1-14, 2009
1992009
Improved approximation schemes for geometrical graphs via\spanners" and\banyans,"
SB Rao, WD Smith
30th ACM Symposium on Theory of Computing (STOC’98), 540-550, 1998
1971998
Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings
M Mihail, C Kaklamanis, S Rao
Proceedings of IEEE 36th Annual Foundations of Computer Science, 548-557, 1995
1871995
The system can't perform the operation now. Try again later.
Articles 1–20