Satish Rao

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 19

Top Venues

CoRR

SODA

ICALP

AlCoB

Publications

Jason Li, Satish Rao, Di Wang
Congestion-Approximators from the Bottom Up. CoRR (2024)
Monika Henzinger, Jason Li, Satish Rao, Di Wang
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA (2024)
Monika Henzinger, Jason Li, Satish Rao, Di Wang
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR (2024)
Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (1) (2021)
Monika Henzinger, Satish Rao, Di Wang
Local Flow Partitioning for Faster Edge Connectivity. SIAM J. Comput. 49 (1) (2020)
Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
Using INC Within Divide-and-Conquer Phylogeny Estimation. AlCoB (2019)
Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms Mol. Biol. 14 (1) (2019)
Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. WABI (2018)
Aaron Schild, Satish Rao, Nikhil Srivastava
Localization of Electrical Flows. SODA (2018)
Monika Henzinger, Satish Rao, Di Wang
Local Flow Partitioning for Faster Edge Connectivity. SODA (2017)
Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
Capacity Releasing Diffusion for Speed and Locality. CoRR (2017)
Monika Henzinger, Satish Rao, Di Wang
Local Flow Partitioning for Faster Edge Connectivity. CoRR (2017)
Prasad Raghavendra, Satish Rao, Tselil Schramm
Strongly refuting random CSPs below the spectral threshold. STOC (2017)
Aaron Schild, Satish Rao, Nikhil Srivastava
Localization of Electrical Flows. CoRR (2017)
Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
Capacity Releasing Diffusion for Speed and Locality. ICML (2017)
Prasad Raghavendra, Satish Rao, Tselil Schramm
Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR (2016)
Ka-Kit Lam, Richard Hall, Alicia Clum, Satish Rao
BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly. BMC Bioinform. 17 (2016)
Di Wang, Satish Rao, Michael W. Mahoney
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. ICALP (2016)
Michael W. Mahoney, Satish Rao, Di Wang, Peng Zhang
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. ICALP (2016)
Di Wang, Satish Rao, Michael W. Mahoney
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. CoRR (2015)
Di Wang, Michael W. Mahoney, Nishanth Mohan, Satish Rao
Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent. CoRR (2015)
Yin Tat Lee, Satish Rao, Nikhil Srivastava
A new approach to computing maximum flows using electrical flows. STOC (2013)
Radu Mihaescu, Cameron Hill, Satish Rao
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. Algorithmica 66 (2) (2013)
Baruch Awerbuch, Rohit Khandekar, Satish Rao
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms 9 (1) (2012)
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Steven J. Lee, Satish Rao, J. D. Tygar
Query Strategies for Evading Convex-Inducing Classifiers. J. Mach. Learn. Res. 13 (2012)
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Steven J. Lee, Satish Rao, J. D. Tygar
Query Strategies for Evading Convex-Inducing Classifiers CoRR (2010)
Sagi Snir, Satish Rao
Quartets MaxCut: A Divide and Conquer Quartets Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (4) (2010)
Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
Spreading Metrics for Vertex Ordering Problems. Algorithmica 56 (4) (2010)
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Steven J. Lee, Satish Rao, Anthony Tran, J. Doug Tygar
Near-Optimal Evasion of Convex-Inducing Classifiers. AISTATS (2010)
Punyashloka Biswal, James R. Lee, Satish Rao
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. J. ACM 57 (3) (2010)
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Steven J. Lee, Satish Rao, Anthony Tran, J. D. Tygar
Near-Optimal Evasion of Convex-Inducing Classifiers CoRR (2010)
Satish Rao, Shuheng Zhou
Edge Disjoint Paths in Moderately Connected Graphs. SIAM J. Comput. 39 (5) (2010)
Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Algorithmica 55 (1) (2009)
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
Graph partitioning using single commodity flows. J. ACM 56 (4) (2009)
Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. Theor. Comput. Sci. 410 (44) (2009)
Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Satish Rao, Nina Taft, J. D. Tygar
ANTIDOTE: understanding and defending against poisoning of anomaly detectors. Internet Measurement Conference (2009)
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
Expander flows, geometric embeddings and graph partitioning. J. ACM 56 (2) (2009)
Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Satish Rao, Nina Taft, J. D. Tygar
Stealthy poisoning attacks on PCA-based anomaly detectors. SIGMETRICS Perform. Evaluation Rev. 37 (2) (2009)
Punyashloka Biswal, James R. Lee, Satish Rao
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows CoRR (2008)
Punyashloka Biswal, James R. Lee, Satish Rao
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. FOCS (2008)
Kamalika Chaudhuri, Satish Rao
Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. COLT (2008)
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
Geometry, flows, and graph-partitioning algorithms. Commun. ACM 51 (10) (2008)
Kamalika Chaudhuri, Satish Rao
Learning Mixtures of Product Distributions Using Correlations and Independence. COLT (2008)
Radu Mihaescu, Cameron Hill, Satish Rao
Fast phylogeny reconstruction through learning of ancestral sequences CoRR (2008)
Sagi Snir, Tandy J. Warnow, Satish Rao
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. J. Comput. Biol. 15 (1) (2008)
Srinath Sridhar, Satish Rao, Eran Halperin
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. RECOMB (2007)
Baruch Awerbuch, Rohit Khandekar, Satish Rao
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA (2007)
Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou
A rigorous analysis of population stratification with limited data. SODA (2007)
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
-traveling repairmen problem. ACM Trans. Algorithms 3 (4) (2007)
Stavros G. Kolliopoulos, Satish Rao
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. 37 (3) (2007)
Satish Rao, Shuheng Zhou
Edge Disjoint Paths in Moderately Connected Graphs. ICALP (1) (2006)
Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. ICALP (1) (2006)
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
Graph partitioning using single commodity flows. STOC (2006)
Kamalika Chaudhuri, Kevin C. Chen, Radu Mihaescu, Satish Rao
On the tandem duplication-random loss model of genome rearrangement. SODA (2006)
Jittat Fakcharoenphol, Satish Rao
Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72 (5) (2006)
Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
spreading metrics for vertex ordering problems. SODA (2006)
Sagi Snir, Satish Rao
Using Max Cut to Enhance Rooted Trees Consistency. IEEE ACM Trans. Comput. Biol. Bioinform. 3 (4) (2006)
Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao
Maximal Accurate Forests from Distance Matrices. RECOMB (2006)
Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
Lower Bounds for Maximum Parsimony with Gene Order Data. Comparative Genomics (2005)
Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. APPROX-RANDOM (2005)
Shlomo Moran, Satish Rao, Sagi Snir
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI (2005)
Kirsten Hildrum, Sean Ma, Satish Rao
Brief announcement: randomized rumor spreading with fewer phone calls. PODC (2004)
Satish Rao, Andréa W. Richa
New Approximation Techniques for Some Linear Ordering Problems. SIAM J. Comput. 34 (2) (2004)
Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao
Distributed Object Location in a Dynamic Network. Theory Comput. Syst. 37 (3) (2004)
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69 (3) (2004)
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
Expander flows, geometric embeddings and graph partitioning. STOC (2004)
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
Approximating metrics by tree metrics. SIGACT News 35 (2) (2004)
Kevin J. Lang, Satish Rao
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. IPCO (2004)
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao
A note on the nearest neighbor in growth-restricted metrics. SODA (2004)
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar
Paths, Trees, and Minimum Latency Tours. FOCS (2003)
Chris Harrelson, Kirsten Hildrum, Satish Rao
A polynomial-time tree decomposition to minimize congestion. SPAA (2003)
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
The k-traveling repairman problem. SODA (2003)
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
A tight bound on approximating arbitrary metrics by tree metrics. STOC (2003)
Eyal Amir, Robert Krauthgamer, Satish Rao
Constant factor approximation of vertex-cuts in planar graphs. STOC (2003)
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
An improved approximation algorithm for the 0-extension problem. SODA (2003)
Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao
Distributed object location in a dynamic network. SPAA (2002)
Jittat Fakcharoenphol, Satish Rao
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS (2001)
Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. 31 (2) (2001)
Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34 (2) (2000)
Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM (2000)
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47 (4) (2000)
Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA (1999)
Stavros G. Kolliopoulos, Satish Rao
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA (1999)
Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas
Portable and Efficient Parallel Computing Using the BSP Model. IEEE Trans. Computers 48 (7) (1999)
Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao
BOS is Boss: A Case for Bulk-Synchronous Object Systems. SPAA (1999)
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. 28 (6) (1999)
Satish Rao
Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. SCG (1999)
Leslie Ann Goldberg, Yossi Matias, Satish Rao
An Optical Simulation of Shared Memory. SIAM J. Comput. 28 (5) (1999)
Frank Thomson Leighton, Satish Rao
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46 (6) (1999)
Andrew V. Goldberg, Satish Rao
Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. 12 (1) (1999)
Tom Leighton, Satish Rao, Aravind Srinivasan
Multicommodity Flow and Circuit Switching. HICSS (7) (1998)
Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling
BSPlib: The BSP programming library. Parallel Comput. 24 (14) (1998)
Satish Rao, Warren D. Smith
Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC (1998)
Andrew V. Goldberg, Satish Rao
Beyond the Flow Decomposition Barrier. J. ACM 45 (5) (1998)
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
-Medians and Related Problems. STOC (1998)
Satish Rao, Andréa W. Richa
New Approximation Techniques for Some Ordering Problems. SODA (1998)
Andrew V. Goldberg, Satish Rao
Beyond the Flow Decomposition Barrier. FOCS (1997)
Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22 (2) (1997)
Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26 (4) (1997)
Andrew V. Goldberg, Satish Rao
Flows in Undirected Unit Capacity Networks. FOCS (1997)

Satish Rao.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Satish Rao