| 2026 | SODA | Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. | Jason Li, Connor Mowry, Satish Rao |
| 2026 | STOC | Shortcutting for Negative-Weight Shortest Paths. | George Z. Li, Jason Li, Satish Rao, Junkai Zhang |
| 2025 | SODA | Congestion-Approximators from the Bottom Up. | Jason Li, Satish Rao, Di Wang |
| 2024 | SODA | Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. | Monika Henzinger, Jason Li, Satish Rao, Di Wang |
| 2018 | SODA | Localization of Electrical Flows. | Aaron Schild, Satish Rao, Nikhil Srivastava |
| 2018 | WABI | New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. | Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow |
| 2017 | ICML | Capacity Releasing Diffusion for Speed and Locality. | Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao |
| 2017 | SODA | Local Flow Partitioning for Faster Edge Connectivity. | Monika Henzinger, Satish Rao, Di Wang |
| 2017 | STOC | Strongly refuting random CSPs below the spectral threshold. | Prasad Raghavendra, Satish Rao, Tselil Schramm |
| 2016 | ICALP | Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. | Michael W. Mahoney, Satish Rao, Di Wang, Peng Zhang |
| 2016 | ICALP | Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. | Di Wang, Satish Rao, Michael W. Mahoney |
| 2013 | STOC | A new approach to computing maximum flows using electrical flows. | Yin Tat Lee, Satish Rao, Nikhil Srivastava |
| 2009 | IMC | ANTIDOTE: understanding and defending against poisoning of anomaly detectors. | Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Satish Rao, Nina Taft, J. D. Tygar |
| 2008 | COLT | Learning Mixtures of Product Distributions Using Correlations and Independence. | Kamalika Chaudhuri, Satish Rao |
| 2008 | COLT | Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. | Kamalika Chaudhuri, Satish Rao |
| 2008 | FOCS | Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. | Punyashloka Biswal, James R. Lee, Satish Rao |
| 2007 | RECOMB | An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. | Srinath Sridhar, Satish Rao, Eran Halperin |
| 2007 | SODA | Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. | Baruch Awerbuch, Rohit Khandekar, Satish Rao |
| 2007 | SODA | A rigorous analysis of population stratification with limited data. | Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou |
| 2006 | ICALP | A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. | Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar |
| 2006 | ICALP | Edge Disjoint Paths in Moderately Connected Graphs. | Satish Rao, Shuheng Zhou |
| 2006 | RECOMB | Maximal Accurate Forests from Distance Matrices. | Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao |
| 2006 | SODA | Untitled record | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
| 2006 | SODA | On the tandem duplication-random loss model of genome rearrangement. | Kamalika Chaudhuri, Kevin C. Chen, Radu Mihaescu, Satish Rao |
| 2006 | STOC | Graph partitioning using single commodity flows. | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
| 2005 | RECOMB | Lower Bounds for Maximum Parsimony with Gene Order Data. | Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah |
| 2005 | WABI | Using Semi-definite Programming to Enhance Supertree Resolvability. | Shlomo Moran, Satish Rao, Sagi Snir |
| 2004 | IPCO | A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. | Kevin J. Lang, Satish Rao |
| 2004 | PODC | Brief announcement: randomized rumor spreading with fewer phone calls. | Kirsten Hildrum, Sean Ma, Satish Rao |
| 2004 | SODA | A note on the nearest neighbor in growth-restricted metrics. | Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao |
| 2004 | STOC | Expander flows, geometric embeddings and graph partitioning. | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
| 2003 | FOCS | Paths, Trees, and Minimum Latency Tours. | Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar |
| 2003 | SODA | The k-traveling repairman problem. | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao |
| 2003 | SODA | An improved approximation algorithm for the 0-extension problem. | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar |
| 2003 | STOC | Constant factor approximation of vertex-cuts in planar graphs. | Eyal Amir, Robert Krauthgamer, Satish Rao |
| 2003 | STOC | A tight bound on approximating arbitrary metrics by tree metrics. | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
| 2003 | SPAA | A polynomial-time tree decomposition to minimize congestion. | Chris Harrelson, Kirsten Hildrum, Satish Rao |
| 2002 | SPAA | Distributed object location in a dynamic network. | Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao |
| 2001 | FOCS | Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. | Jittat Fakcharoenphol, Satish Rao |
| 2000 | INFOCOM | Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. | Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao |
| 1999 | ESA | A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. | Stavros G. Kolliopoulos, Satish Rao |
| 1999 | SODA | New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. | Frank Thomson Leighton, Satish Rao, Aravind Srinivasan |
| 1999 | SPAA | BOS is Boss: A Case for Bulk-Synchronous Object Systems. | Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao |
| 1998 | SODA | New Approximation Techniques for Some Ordering Problems. | Satish Rao, Andra W. Richa |
| 1998 | STOC | Approximation Schemes for Euclidean | Sanjeev Arora, Prabhakar Raghavan, Satish Rao |
| 1998 | STOC | Approximating Geometrical Graphs via "Spanners" and "Banyans". | Satish Rao, Warren D. Smith |
| 1997 | FOCS | Beyond the Flow Decomposition Barrier. | Andrew V. Goldberg, Satish Rao |
| 1997 | FOCS | Flows in Undirected Unit Capacity Networks. | Andrew V. Goldberg, Satish Rao |
| 1997 | SODA | Fast Approximate Graph Partitioning Algorithms. | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
| 1996 | FOCS | Computing Vertex Connectivity: New Bounds from Old Techniques. | Monika Rauch Henzinger, Satish Rao, Harold N. Gabow |
| 1996 | ICPR | "Ratio regions": a technique for image segmentation. | Ingemar J. Cox, Satish Rao, Yu Zhong |
| 1996 | SPAA | Towards Efficiency and Portability: Programming with the BSP Model. | Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas |
| 1995 | FOCS | Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
| 1995 | FOCS | Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. | Milena Mihail, Christos Kaklamanis, Satish Rao |
| 1994 | SODA | Shallow Excluded Minors and Improved Graph Decompositions. | Serge A. Plotkin, Satish Rao, Warren D. Smith |
| 1994 | STOC | Faster shortest-path algorithms for planar graphs. | Philip N. Klein, Satish Rao, Monika Rauch, Sairam Subramanian |
| 1994 | SPAA | An Optical Simulation of Shared Memory. | Leslie Ann Goldberg, Yossi Matias, Satish Rao |
| 1993 | FOCS | Universal Emulations with Sublogarithmic Slowdown | Christos Kaklamanis, Danny Krizanc, Satish Rao |
| 1993 | FOCS | Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) | Charles E. Leiserson, Satish Rao, Sivan Toledo |
| 1993 | SODA | Finding Near-Optimal Cuts: An Empirical Evaluation. | Kevin J. Lang, Satish Rao |
| 1993 | STOC | Approximate load balancing on dynamic and asynchronous networks. | William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao |
| 1993 | STOC | Excluded minors, network decomposition, and multicommodity flow. | Philip N. Klein, Serge A. Plotkin, Satish Rao |
| 1993 | SPAA | A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. | Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao |
| 1993 | SPAA | New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. | Christos Kaklamanis, Danny Krizanc, Satish Rao |
| 1992 | BMVC | Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution. | Ingemar J. Cox, Sunita L. Hingorani, Bruce M. Maggs, Satish Rao |
| 1992 | STOC | Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) | Satish Rao |
| 1992 | SPAA | Simple Path Selection for Optimal Routing on Processor Arrays. | Christos Kaklamanis, Danny Krizanc, Satish Rao |
| 1990 | FOCS | 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 |
| 1990 | FOCS | Approximation through Multicommodity Flow | Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao |
| 1989 | STOC | Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) | Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg |
| 1988 | FOCS | Universal Packet Routing Algorithms (Extended Abstract) | Frank Thomson Leighton, Bruce M. Maggs, Satish Rao |
| 1988 | FOCS | An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms | Frank Thomson Leighton, Satish Rao |
| 1987 | FOCS | Finding Near Optimal Separators in Planar Graphs | Satish Rao |