Satish B Rao

Citée par

	Toutes	Depuis 2019
Citations	18427	4101
indice h	63	33
indice i10	117	59

820

410

205

615

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202473 103 128 153 178 224 319 365 335 348 339 331 503 577 641 655 714 632 679 774 747 734 806 735 653 654 709 819 773 727 696 696 669 540

Accès public

Tout afficher

9 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Jittat FakcharoenpholKasetsart UniversityAdresse e-mail validée de ku.ac.th
Bruce MaggsProfessor of Computer Science, Duke UniversityAdresse e-mail validée de cs.duke.edu
Kunal TalwarApple IncAdresse e-mail validée de apple.com
Philip KleinProfessor of Computer Science, Brown UniversityAdresse e-mail validée de brown.edu
Sanjeev AroraProfessor of Computer Science, Princeton UniversityAdresse e-mail validée de cs.princeton.edu
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Adresse e-mail validée de ist.ac.at
Torsten SuelProfessor of Computer Science, NYU Tandon School of EngineeringAdresse e-mail validée de nyu.edu
Christos KaklamanisUniversity of Patras & Computer Technology Institute and Press "Diophantus"Adresse e-mail validée de ceid.upatras.gr
Ingemar J. CoxDepartment of Computer Science, University College London / University of CopenhagenAdresse e-mail validée de ucl.ac.uk
Ravi SundaramProfessor, Computer Science, Northeastern UniversityAdresse e-mail validée de ccs.neu.edu
Gary L. MillerCarnegie Mellon UniversityAdresse e-mail validée de cs.cmu.edu
Sagi SnirUniversity of HaifaAdresse e-mail validée de research.haifa.ac.il
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Adresse e-mail validée de alum.mit.edu
Benjamin I. P. RubinsteinProfessor, School of Computing and Information Systems, The University of MelbourneAdresse e-mail validée de unimelb.edu.au
Anthony D. JosephUniversity of California BerkeleyAdresse e-mail validée de eecs.berkeley.edu
John KubiatowiczUniversity of California at BerkeleyAdresse e-mail validée de cs.berkeley.edu
Chris HarrelsonSoftware Engineer, GoogleAdresse e-mail validée de google.com
Prabhakar RaghavanGoogleAdresse e-mail validée de google.com
Stavros KolliopoulosNational and Kapodistrian University of AthensAdresse e-mail validée de di.uoa.gr
Nina TaftPrincipal Research Scientist, GoogleAdresse e-mail validée de google.com

Suivre

Satish B Rao

Affiliation inconnue

Adresse e-mail validée de berkeley.edu


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	1080	1999
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	1038	2003
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	1034	2009
Optimal route selection in a content delivery network CF Bornstein, TK Canfield, GL Miller, SB Rao, R Sundaram US Patent 7,274,658, 2007	973*	2007
A maximum likelihood stereo algorithm IJ Cox, SL Hingorani, SB Rao, BM Maggs Computer vision and image understanding 63 (3), 542-567, 1996	779	1996
Beyond the flow decomposition barrier AV Goldberg, S Rao Journal of the ACM (JACM) 45 (5), 783-797, 1998	687	1998
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	657	1988
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	578	2008
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	540	1998
BSPlib: The BSP programming library JMD Hill, B McColl, DC Stefanescu, MW Goudreau, K Lang, SB Rao, ... Parallel Computing 24 (14), 1947-1980, 1998	530	1998
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	530	1997
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	522	2002
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	487	2009
Packet routing and job-shop scheduling inO(congestion+dilation) steps FT Leighton, BM Maggs, SB Rao Combinatorica 14 (2), 167-186, 1994	401	1994
A faster deterministic maximum flow algorithm V King, S Rao, R Tarjan Journal of Algorithms 17 (3), 447-474, 1994	306	1994
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	287	2000
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	281	1993
Approximating geometrical graphs via “spanners” and “banyans” SB Rao, WD Smith Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	250	1998
Universal packet routing algorithms T Leighton, B Maggs, S Rao [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988	229	1988
Graph partitioning using single commodity flows R Khandekar, S Rao, U Vazirani Journal of the ACM (JACM) 56 (4), 1-15, 2009	228	2009

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs