Finding Near Optimal Separators in Planar Graphs - Satish Rao (FOCS, 1987)

Universal Packet Routing Algorithms (Extended Abstract) - Frank Thomson Leighton; Bruce M. Maggs; Satish Rao (FOCS, 1988)

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms - Frank Thomson Leighton; Satish Rao (FOCS, 1988)

Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) - Richard R. Koch; Frank Thomson Leighton; Bruce M. Maggs; Satish Rao; Arnold L. Rosenberg (STOC, 1989)

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) - Christos Kaklamanis; Anna R. Karlin; Frank Thomson Leighton; Victor Milenkovic; Prabhakar Raghavan; Satish Rao; Clark D. Thomborson; A. Tsantilas (FOCS, 1990)

Approximation through Multicommodity Flow - Philip N. Klein; Ajit Agrawal; R. Ravi 001; Satish Rao (FOCS, 1990)

Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution. - Ingemar J. Cox; Sunita L. Hingorani; Bruce M. Maggs; Satish Rao (BMVC, 1992)

Simple Path Selection for Optimal Routing on Processor Arrays. - Christos Kaklamanis; Danny Krizanc; Satish Rao (SPAA, 1992)

Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) - Satish Rao (STOC, 1992)

Universal Emulations with Sublogarithmic Slowdown - Christos Kaklamanis; Danny Krizanc; Satish Rao (FOCS, 1993)

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) - Charles E. Leiserson; Satish Rao; Sivan Toledo (FOCS, 1993)

Finding Near-Optimal Cuts: An Empirical Evaluation. - Kevin J. Lang; Satish Rao (SODA, 1993)

A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. - Leslie Ann Goldberg; Mark Jerrum; Frank Thomson Leighton; Satish Rao (SPAA, 1993)

New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. - Christos Kaklamanis; Danny Krizanc; Satish Rao (SPAA, 1993)

Approximate load balancing on dynamic and asynchronous networks. - William Aiello; Baruch Awerbuch; Bruce M. Maggs; Satish Rao (STOC, 1993)

Excluded minors, network decomposition, and multicommodity flow. - Philip N. Klein; Serge A. Plotkin; Satish Rao (STOC, 1993)

Shallow Excluded Minors and Improved Graph Decompositions. - Serge A. Plotkin; Satish Rao; Warren D. Smith (SODA, 1994)

Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. - Frank Thomson Leighton; Bruce M. Maggs; Satish Rao (Comb., 1994)

Randomized Routing and Sorting on Fixed-Connection Networks. - Frank Thomson Leighton; Bruce M. Maggs; Abhiram G. Ranade; Satish Rao (J. Algorithms, 1994)

Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (FOCS, 1995)

Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. - Milena Mihail; Christos Kaklamanis; Satish Rao (FOCS, 1995)

Efficient communication using total-exchange. - Satish Rao; Torsten Suel; Thanasis Tsantilas; Mark W. Goudreau (IPPS, 1995)

An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. - Philip N. Klein; Satish Rao; Ajit Agrawal; R. Ravi 001 (Comb., 1995)

"Ratio regions": a technique for image segmentation. - Ingemar J. Cox; Satish Rao; Yu Zhong (ICPR, 1996)

Towards Efficiency and Portability: Programming with the BSP Model. - Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas (SPAA, 1996)

A Maximum Likelihood Stereo Algorithm. - Ingemar J. Cox; Sunita L. Hingorani; Satish Rao; Bruce M. Maggs (Comput. Vis. Image Underst., 1996)

Spreading Metric Based Graph Partitioning Algorithms. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (PP, 1997)

Work-preserving emulations of fixed-connection networks. - Richard R. Koch; Frank Thomson Leighton; Bruce M. Maggs; Satish Rao; Arnold L. Rosenberg; Eric J. Schwabe (J. ACM, 1997)

Approximation Algorithms for Steiner and Directed Multicuts. - Philip N. Klein; Serge A. Plotkin; Satish Rao; Éva Tardos (J. Algorithms, 1997)

Faster Shortest-Path Algorithms for Planar Graphs. - Monika Rauch Henzinger; Philip N. Klein; Satish Rao; Sairam Subramanian (J. Comput. Syst. Sci., 1997)

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. - Charles E. Leiserson; Satish Rao; Sivan Toledo (J. Comput. Syst. Sci., 1997)

New Graph Decompositions with Applications to Emulations. - Christos Kaklamanis; Danny Krizanc; Satish Rao (Theory Comput. Syst., 1997)

Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. - Leslie Ann Goldberg; Mark Jerrum; Frank Thomson Leighton; Satish Rao (SIAM J. Comput., 1997)

A Multimedia Presentation Toolkit for the World Wide Web. - Johnny Wong 001; Satish Rao; Naveen Ramaiah (Softw. Pract. Exp., 1997)

Multicommodity Flow and Circuit Switching. - Tom Leighton; Satish Rao; Aravind Srinivasan (HICSS (7), 1998)

New Approximation Techniques for Some Ordering Problems. - Satish Rao; Andréa W. Richa (SODA, 1998)

Approximation Schemes for Euclidean k-Medians and Related Problems. - Sanjeev Arora; Prabhakar Raghavan; Satish Rao (STOC, 1998)

Approximating Geometrical Graphs via "Spanners" and "Banyans". - Satish Rao; Warren D. Smith (STOC, 1998)

Beyond the Flow Decomposition Barrier. - Andrew V. Goldberg; Satish Rao (J. ACM, 1998)

BSPlib: The BSP programming library. - Jonathan M. D. Hill; Bill McColl; Dan C. Stefanescu; Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas; Rob H. Bisseling (Parallel Comput., 1998)

Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. - Satish Rao (SCG, 1999)

A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. - Stavros G. Kolliopoulos; Satish Rao (ESA, 1999)

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. - Frank Thomson Leighton; Satish Rao; Aravind Srinivasan (SODA, 1999)

BOS is Boss: A Case for Bulk-Synchronous Object Systems. - Mark W. Goudreau; Kevin J. Lang; Girija J. Narlikar; Satish Rao (SPAA, 1999)

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. - Frank Thomson Leighton; Satish Rao (J. ACM, 1999)

Fast Approximate Graph Partitioning Algorithms. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (SIAM J. Comput., 1999)

An Optical Simulation of Shared Memory. - Leslie Ann Goldberg; Yossi Matias; Satish Rao (SIAM J. Comput., 1999)

Flows in Undirected Unit Capacity Networks. - Andrew V. Goldberg; Satish Rao (SIAM J. Discret. Math., 1999)

Portable and Efficient Parallel Computing Using the BSP Model. - Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas (IEEE Trans. Computers, 1999)

Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. - Mark W. Goudreau; Stavros G. Kolliopoulos; Satish Rao (INFOCOM, 2000)

Divide-and-conquer approximation algorithms via spreading metrics. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (J. ACM, 2000)

Computing Vertex Connectivity: New Bounds from Old Techniques. - Monika Rauch Henzinger; Satish Rao; Harold N. Gabow (J. Algorithms, 2000)

Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. - Jittat Fakcharoenphol; Satish Rao (FOCS, 2001)

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. - Frank Thomson Leighton; Chi-Jen Lu; Satish Rao; Aravind Srinivasan (SIAM J. Comput., 2001)

Paths, Trees, and Minimum Latency Tours. - Kamalika Chaudhuri; Brighten Godfrey; Satish Rao; Kunal Talwar (FOCS, 2003)

The k-traveling repairman problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao (SODA, 2003)

An improved approximation algorithm for the 0-extension problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao; Kunal Talwar (SODA, 2003)

A polynomial-time tree decomposition to minimize congestion. - Chris Harrelson; Kirsten Hildrum; Satish Rao (SPAA, 2003)

Constant factor approximation of vertex-cuts in planar graphs. - Eyal Amir; Robert Krauthgamer; Satish Rao (STOC, 2003)

A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. - Kevin J. Lang; Satish Rao (IPCO, 2004)

Brief announcement: randomized rumor spreading with fewer phone calls. - Kirsten Hildrum; Sean Ma; Satish Rao (PODC, 2004)

A note on the nearest neighbor in growth-restricted metrics. - Kirsten Hildrum; John Kubiatowicz; Sean Ma; Satish Rao (SODA, 2004)

A tight bound on approximating arbitrary metrics by tree metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (J. Comput. Syst. Sci., 2004)

Distributed Object Location in a Dynamic Network. - Kirsten Hildrum; John D. Kubiatowicz; Satish Rao; Ben Y. Zhao (Theory Comput. Syst., 2004)

New Approximation Techniques for Some Linear Ordering Problems. - Satish Rao; Andréa W. Richa (SIAM J. Comput., 2004)

Approximating metrics by tree metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (SIGACT News, 2004)

Lower Bounds for Maximum Parsimony with Gene Order Data. - Abraham Bachrach; Kevin C. Chen; Chris Harrelson; Radu Mihaescu; Satish Rao; Apurva Shah (Comparative Genomics, 2005)

Using Semi-definite Programming to Enhance Supertree Resolvability. - Shlomo Moran; Satish Rao; Sagi Snir (WABI, 2005)

A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. - Kamalika Chaudhuri; Satish Rao; Samantha J. Riesenfeld; Kunal Talwar (ICALP (1), 2006)

Maximal Accurate Forests from Distance Matrices. - Constantinos Daskalakis; Cameron Hill; Alexander Jaffe; Radu Mihaescu; Elchanan Mossel; Satish Rao (RECOMB, 2006)

l22 spreading metrics for vertex ordering problems. - Moses Charikar; Mohammad Taghi Hajiaghayi; Howard J. Karloff; Satish Rao (SODA, 2006)

On the tandem duplication-random loss model of genome rearrangement. - Kamalika Chaudhuri; Kevin C. Chen; Radu Mihaescu; Satish Rao (SODA, 2006)

Planar graphs, negative weight edges, shortest paths, and near linear time. - Jittat Fakcharoenphol; Satish Rao (J. Comput. Syst. Sci., 2006)

Using Max Cut to Enhance Rooted Trees Consistency. - Sagi Snir; Satish Rao (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. - Srinath Sridhar 001; Satish Rao; Eran Halperin (RECOMB, 2007)

A rigorous analysis of population stratification with limited data. - Kamalika Chaudhuri; Eran Halperin; Satish Rao; Shuheng Zhou 002 (SODA, 2007)

A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. - Stavros G. Kolliopoulos; Satish Rao (SIAM J. Comput., 2007)

The k-traveling repairmen problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao (ACM Trans. Algorithms, 2007)

Learning Mixtures of Product Distributions Using Correlations and Independence. - Kamalika Chaudhuri; Satish Rao (COLT, 2008)

Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. - Kamalika Chaudhuri; Satish Rao (COLT, 2008)

Geometry, flows, and graph-partitioning algorithms. - Sanjeev Arora; Satish Rao; Umesh V. Vazirani (Commun. ACM, 2008)

Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. - Sagi Snir; Tandy J. Warnow; Satish Rao (J. Comput. Biol., 2008)

Shortest Paths in Planar Graphs with Negative Weight Edges. - Jittat Fakcharoenphol; Satish Rao (Encyclopedia of Algorithms, 2008)

Approximating Metric Spaces by Tree Metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (Encyclopedia of Algorithms, 2008)

ANTIDOTE: understanding and defending against poisoning of anomaly detectors. - Benjamin I. P. Rubinstein; Blaine Nelson; Ling Huang 001; Anthony D. Joseph; Shing-hon Lau; Satish Rao; Nina Taft; J. D. Tygar (Internet Measurement Conference, 2009)

What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. - Kamalika Chaudhuri; Satish Rao; Samantha J. Riesenfeld; Kunal Talwar (Algorithmica, 2009)

Expander flows, geometric embeddings and graph partitioning. - Sanjeev Arora; Satish Rao; Umesh V. Vazirani (J. ACM, 2009)

Graph partitioning using single commodity flows. - Rohit Khandekar; Satish Rao; Umesh V. Vazirani (J. ACM, 2009)

Stealthy poisoning attacks on PCA-based anomaly detectors. - Benjamin I. P. Rubinstein; Blaine Nelson; Ling Huang 001; Anthony D. Joseph; Shing-hon Lau; Satish Rao; Nina Taft; J. D. Tygar (SIGMETRICS Perform. Evaluation Rev., 2009)

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. - Kamalika Chaudhuri; Satish Rao; Samantha J. Riesenfeld; Kunal Talwar (Theor. Comput. Sci., 2009)

l22 Spreading Metrics for Vertex Ordering Problems. - Moses Charikar; Mohammad Taghi Hajiaghayi; Howard J. Karloff; Satish Rao (Algorithmica, 2010)

Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. - Punyashloka Biswal; James R. Lee; Satish Rao (J. ACM, 2010)

Near-Optimal Evasion of Convex-Inducing Classifiers. - Blaine Nelson; Benjamin I. P. Rubinstein; Ling Huang 001; Anthony D. Joseph; Shing-hon Lau; Steven J. Lee; Satish Rao; Anthony Tran; J. Doug Tygar (AISTATS, 2010)

Edge Disjoint Paths in Moderately Connected Graphs. - Satish Rao; Shuheng Zhou 002 (SIAM J. Comput., 2010)

Quartets MaxCut: A Divide and Conquer Quartets Algorithm. - Sagi Snir; Satish Rao (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Query Strategies for Evading Convex-Inducing Classifiers. - Blaine Nelson; Benjamin I. P. Rubinstein; Ling Huang 001; Anthony D. Joseph; Steven J. Lee; Satish Rao; J. D. Tygar (J. Mach. Learn. Res., 2012)

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. - Baruch Awerbuch; Rohit Khandekar; Satish Rao (ACM Trans. Algorithms, 2012)

A new approach to computing maximum flows using electrical flows. - Yin Tat Lee; Satish Rao; Nikhil Srivastava (STOC, 2013)

Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. - Radu Mihaescu; Cameron Hill; Satish Rao (Algorithmica, 2013)

Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent. - Di Wang 005; Michael W. Mahoney; Nishanth Mohan; Satish Rao (CoRR, 2015)

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. - Michael W. Mahoney; Satish Rao; Di Wang 005; Peng Zhang 052 (ICALP, 2016)

Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. - Di Wang 005; Satish Rao; Michael W. Mahoney (ICALP, 2016)

BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly. - Ka-Kit Lam; Richard Hall; Alicia Clum; Satish Rao (BMC Bioinform., 2016)

Shortest Paths in Planar Graphs with Negative Weight Edges. - Jittat Fakcharoenphol; Satish Rao (Encyclopedia of Algorithms, 2016)

Approximating Metric Spaces by Tree Metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (Encyclopedia of Algorithms, 2016)

Capacity Releasing Diffusion for Speed and Locality. - Di Wang 005; Kimon Fountoulakis; Monika Henzinger; Michael W. Mahoney; Satish Rao (ICML, 2017)

Strongly refuting random CSPs below the spectral threshold. - Prasad Raghavendra; Satish Rao; Tselil Schramm (STOC, 2017)

Localization of Electrical Flows. - Aaron Schild; Satish Rao; Nikhil Srivastava (SODA, 2018)

New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. - Qiuyi (Richard) Zhang; Satish Rao; Tandy J. Warnow (WABI, 2018)

Using INC Within Divide-and-Conquer Phylogeny Estimation. - Thien Le; Aaron Sy; Erin K. Molloy; Qiuyi (Richard) Zhang; Satish Rao; Tandy J. Warnow (AlCoB, 2019)

Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. - Qiuyi Zhang 001; Satish Rao; Tandy J. Warnow (Algorithms Mol. Biol., 2019)

Local Flow Partitioning for Faster Edge Connectivity. - Monika Henzinger; Satish Rao; Di Wang 005 (SIAM J. Comput., 2020)

Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation. - Thien Le; Aaron Sy; Erin K. Molloy; Qiuyi Zhang 001; Satish Rao; Tandy J. Warnow (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. - Monika Henzinger; Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2024)

Congestion-Approximators from the Bottom Up. - Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2025)