Folgen
Satish B Rao
Satish B Rao
Zugehörigkeit unbekannt
Bestätigte E-Mail-Adresse bei berkeley.edu
Titel
Zitiert von
Zitiert von
Jahr
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
10971999
A tight bound on approximating arbitrary metrics by tree metrics
J Fakcharoenphol, S Rao, K Talwar
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
10582003
Expander flows, geometric embeddings and graph partitioning
S Arora, S Rao, U Vazirani
Journal of the ACM (JACM) 56 (2), 1-37, 2009
10512009
Optimal route selection in a content delivery network
CF Bornstein, TK Canfield, GL Miller, SB Rao, R Sundaram
US Patent 7,274,658, 2007
996*2007
A maximum likelihood stereo algorithm
IJ Cox, SL Hingorani, SB Rao, BM Maggs
Computer vision and image understanding 63 (3), 542-567, 1996
7811996
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
6891998
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
6611988
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
5782008
Approximation schemes for Euclidean k-medians and related problems
S Arora, P Raghavan, S Rao
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
5451998
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
5351997
BSPlib: The BSP programming library
JMD Hill, B McColl, DC Stefanescu, MW Goudreau, K Lang, SB Rao, ...
Parallel Computing 24 (14), 1947-1980, 1998
5331998
Distributed object location in a dynamic network
K Hildrum, JD Kubiatowicz, S Rao, BY Zhao
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
5222002
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
4972009
Packet routing and job-shop scheduling inO(congestion+dilation) steps
FT Leighton, BM Maggs, SB Rao
Combinatorica 14 (2), 167-186, 1994
4031994
A faster deterministic maximum flow algorithm
V King, S Rao, R Tarjan
Journal of Algorithms 17 (3), 447-474, 1994
3091994
Divide-and-conquer approximation algorithms via spreading metrics
G Even, JS Naor, S Rao, B Schieber
Journal of the ACM (JACM) 47 (4), 585-616, 2000
2912000
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
2911993
Approximating geometrical graphs via “spanners” and “banyans”
SB Rao, WD Smith
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
2611998
Universal packet routing algorithms
T Leighton, B Maggs, S Rao
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988
2321988
Graph partitioning using single commodity flows
R Khandekar, S Rao, U Vazirani
Journal of the ACM (JACM) 56 (4), 1-15, 2009
2312009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20