Satish Rao - RankMe

142 papers A* 51A 4B 12C 2Journal 60Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. SODA Jason Li, Connor Mowry, Satish Rao
2025	A*	`conf`	Congestion-Approximators from the Bottom Up. SODA Jason Li, Satish Rao, Di Wang
2025	J	`jnl`	Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. CoRR Jason Li, Connor Mowry, Satish Rao
2025	J	`jnl`	Shortcutting for Negative-Weight Shortest Path. CoRR George Z. Li, Jason Li, Satish Rao, Junkai Zhang
2024	J	`jnl`	Congestion-Approximators from the Bottom Up. CoRR Jason Li, Satish Rao, Di Wang
2024	A*	`conf`	Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024	J	`jnl`	Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR Monika Henzinger, Jason Li, Satish Rao, Di Wang
2021	J	`jnl`	Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation. IEEE ACM Trans. Comput. Biol. Bioinform. Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi Zhang, Satish Rao, Tandy J. Warnow
2020	J	`jnl`	Local Flow Partitioning for Faster Edge Connectivity. SIAM J. Comput. Monika Henzinger, Satish Rao, Di Wang
2019	J	`jnl`	Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms Mol. Biol. Qiuyi Zhang, Satish Rao, Tandy J. Warnow
2019	—	`conf`	Using INC Within Divide-and-Conquer Phylogeny Estimation. AlCoB Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
2018	A*	`conf`	Localization of Electrical Flows. SODA Aaron Schild, Satish Rao, Nikhil Srivastava
2018	C	`conf`	New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. WABI Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow
2017	A*	`conf`	Capacity Releasing Diffusion for Speed and Locality. ICML Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
2017	J	`jnl`	Capacity Releasing Diffusion for Speed and Locality. CoRR Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
2017	A*	`conf`	Local Flow Partitioning for Faster Edge Connectivity. SODA Monika Henzinger, Satish Rao, Di Wang
2017	J	`jnl`	Local Flow Partitioning for Faster Edge Connectivity. CoRR Monika Henzinger, Satish Rao, Di Wang
2017	J	`jnl`	Localization of Electrical Flows. CoRR Aaron Schild, Satish Rao, Nikhil Srivastava
2017	A*	`conf`	Strongly refuting random CSPs below the spectral threshold. STOC Prasad Raghavendra, Satish Rao, Tselil Schramm
2016	—	`ch.`	Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2016	A*	`conf`	Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. ICALP Michael W. Mahoney, Satish Rao, Di Wang, Peng Zhang
2016	J	`jnl`	BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly. BMC Bioinform. Ka-Kit Lam, Richard Hall, Alicia Clum, Satish Rao
2016	—	`ch.`	Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao
2016	J	`jnl`	Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR Prasad Raghavendra, Satish Rao, Tselil Schramm
2016	A*	`conf`	Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. ICALP Di Wang, Satish Rao, Michael W. Mahoney
2015	J	`jnl`	Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent. CoRR Di Wang, Michael W. Mahoney, Nishanth Mohan, Satish Rao
2015	J	`jnl`	Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. CoRR Di Wang, Satish Rao, Michael W. Mahoney
2013	A*	`conf`	A new approach to computing maximum flows using electrical flows. STOC Yin Tat Lee, Satish Rao, Nikhil Srivastava
2013	J	`jnl`	Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. Algorithmica Radu Mihaescu, Cameron Hill, Satish Rao
2012	J	`jnl`	Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms Baruch Awerbuch, Rohit Khandekar, Satish Rao
2012	J	`jnl`	Query Strategies for Evading Convex-Inducing Classifiers. J. Mach. Learn. Res. Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Steven J. Lee, Satish Rao, J. D. Tygar
2010	J	`jnl`	Edge Disjoint Paths in Moderately Connected Graphs. SIAM J. Comput. Satish Rao, Shuheng Zhou
2010	J	`jnl`	Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. J. ACM Punyashloka Biswal, James R. Lee, Satish Rao
2010	J	`jnl`	Near-Optimal Evasion of Convex-Inducing Classifiers CoRR Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Steven J. Lee, Satish Rao, Anthony Tran, J. D. Tygar
2010	A	`conf`	Near-Optimal Evasion of Convex-Inducing Classifiers. AISTATS Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Steven J. Lee, Satish Rao, Anthony Tran, J. Doug Tygar
2010	J	`jnl`	Quartets MaxCut: A Divide and Conquer Quartets Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. Sagi Snir, Satish Rao
2010	J	`jnl`	Query Strategies for Evading Convex-Inducing Classifiers CoRR Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Steven J. Lee, Satish Rao, J. D. Tygar
2009	J	`jnl`	A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. Theor. Comput. Sci. Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
2009	A	`conf`	ANTIDOTE: understanding and defending against poisoning of anomaly detectors. Internet Measurement Conference Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Satish Rao, Nina Taft, J. D. Tygar
2009	J	`jnl`	Expander flows, geometric embeddings and graph partitioning. J. ACM Sanjeev Arora, Satish Rao, Umesh V. Vazirani
2009	J	`jnl`	Graph partitioning using single commodity flows. J. ACM Rohit Khandekar, Satish Rao, Umesh V. Vazirani
2009	J	`jnl`	Stealthy poisoning attacks on PCA-based anomaly detectors. SIGMETRICS Perform. Evaluation Rev. Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Satish Rao, Nina Taft, J. D. Tygar
2009	J	`jnl`	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Algorithmica Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
2008	—	`ch.`	Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2008	A*	`conf`	Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. COLT Kamalika Chaudhuri, Satish Rao
2008	A*	`conf`	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. FOCS Punyashloka Biswal, James R. Lee, Satish Rao
2008	J	`jnl`	Eigenvalue bounds, spectral partitioning, and metrical deformations via flows CoRR Punyashloka Biswal, James R. Lee, Satish Rao
2008	J	`jnl`	Fast phylogeny reconstruction through learning of ancestral sequences CoRR Radu Mihaescu, Cameron Hill, Satish Rao
2008	J	`jnl`	Geometry, flows, and graph-partitioning algorithms. Commun. ACM Sanjeev Arora, Satish Rao, Umesh V. Vazirani
2008	A*	`conf`	Learning Mixtures of Product Distributions Using Correlations and Independence. COLT Kamalika Chaudhuri, Satish Rao
2008	J	`jnl`	Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. J. Comput. Biol. Sagi Snir, Tandy J. Warnow, Satish Rao
2008	—	`ch.`	Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao
2007	J	`jnl`	A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. Stavros G. Kolliopoulos, Satish Rao
2007	A*	`conf`	A rigorous analysis of population stratification with limited data. SODA Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou
2007	B	`conf`	An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. RECOMB Srinath Sridhar, Satish Rao, Eran Halperin
2007	A*	`conf`	Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA Baruch Awerbuch, Rohit Khandekar, Satish Rao
2007	J	`jnl`	The ACM Trans. Algorithms Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
2006	—	`conf`	A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. ICALP (1) Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
2006	—	`conf`	Edge Disjoint Paths in Moderately Connected Graphs. ICALP (1) Satish Rao, Shuheng Zhou
2006	A*	`conf`	Graph partitioning using single commodity flows. STOC Rohit Khandekar, Satish Rao, Umesh V. Vazirani
2006	B	`conf`	Maximal Accurate Forests from Distance Matrices. RECOMB Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao
2006	A*	`conf`	On the tandem duplication-random loss model of genome rearrangement. SODA Kamalika Chaudhuri, Kevin C. Chen, Radu Mihaescu, Satish Rao
2006	J	`jnl`	Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. Jittat Fakcharoenphol, Satish Rao
2006	J	`jnl`	Using Max Cut to Enhance Rooted Trees Consistency. IEEE ACM Trans. Comput. Biol. Bioinform. Sagi Snir, Satish Rao
2005	—	`conf`	Lower Bounds for Maximum Parsimony with Gene Order Data. Comparative Genomics Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
2005	C	`conf`	Using Semi-definite Programming to Enhance Supertree Resolvability. WABI Shlomo Moran, Satish Rao, Sagi Snir
2005	—	`conf`	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. APPROX-RANDOM Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar
2004	B	`conf`	A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. IPCO Kevin J. Lang, Satish Rao
2004	A*	`conf`	A note on the nearest neighbor in growth-restricted metrics. SODA Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao
2004	J	`jnl`	A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2004	J	`jnl`	Approximating metrics by tree metrics. SIGACT News Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2004	A*	`conf`	Brief announcement: randomized rumor spreading with fewer phone calls. PODC Kirsten Hildrum, Sean Ma, Satish Rao
2004	J	`jnl`	Distributed Object Location in a Dynamic Network. Theory Comput. Syst. Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao
2004	A*	`conf`	Expander flows, geometric embeddings and graph partitioning. STOC Sanjeev Arora, Satish Rao, Umesh V. Vazirani
2004	J	`jnl`	New Approximation Techniques for Some Linear Ordering Problems. SIAM J. Comput. Satish Rao, Andréa W. Richa
2003	B	`conf`	A polynomial-time tree decomposition to minimize congestion. SPAA Chris Harrelson, Kirsten Hildrum, Satish Rao
2003	A*	`conf`	A tight bound on approximating arbitrary metrics by tree metrics. STOC Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2003	A*	`conf`	An improved approximation algorithm for the 0-extension problem. SODA Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
2003	A*	`conf`	Constant factor approximation of vertex-cuts in planar graphs. STOC Eyal Amir, Robert Krauthgamer, Satish Rao
2003	A*	`conf`	Paths, Trees, and Minimum Latency Tours. FOCS Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar
2003	A*	`conf`	The k-traveling repairman problem. SODA Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
2002	B	`conf`	Distributed object location in a dynamic network. SPAA Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao
2001	J	`jnl`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
2001	A*	`conf`	Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS Jittat Fakcharoenphol, Satish Rao
2000	J	`jnl`	Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
2000	J	`jnl`	Divide-and-conquer approximation algorithms via spreading metrics. J. ACM Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
2000	A*	`conf`	Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
1999	A	`conf`	A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA Stavros G. Kolliopoulos, Satish Rao
1999	J	`jnl`	An Optical Simulation of Shared Memory. SIAM J. Comput. Leslie Ann Goldberg, Yossi Matias, Satish Rao
1999	B	`conf`	BOS is Boss: A Case for Bulk-Synchronous Object Systems. SPAA Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao
1999	J	`jnl`	Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1999	J	`jnl`	Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. Andrew V. Goldberg, Satish Rao
1999	J	`jnl`	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM Frank Thomson Leighton, Satish Rao
1999	A*	`conf`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
1999	J	`jnl`	Portable and Efficient Parallel Computing Using the BSP Model. IEEE Trans. Computers Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas
1999	—	`conf`	Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. SCG Satish Rao
1998	A*	`conf`	Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC Satish Rao, Warren D. Smith
1998	A*	`conf`	Approximation Schemes for Euclidean STOC Sanjeev Arora, Prabhakar Raghavan, Satish Rao
1998	J	`jnl`	BSPlib: The BSP programming library. Parallel Comput. Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling
1998	J	`jnl`	Beyond the Flow Decomposition Barrier. J. ACM Andrew V. Goldberg, Satish Rao
1998	—	`conf`	Multicommodity Flow and Circuit Switching. HICSS (7) Tom Leighton, Satish Rao, Aravind Srinivasan
1998	A*	`conf`	New Approximation Techniques for Some Ordering Problems. SODA Satish Rao, Andréa W. Richa
1997	J	`jnl`	A Multimedia Presentation Toolkit for the World Wide Web. Softw. Pract. Exp. Johnny Wong, Satish Rao, Naveen Ramaiah
1997	J	`jnl`	Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
1997	A*	`conf`	Beyond the Flow Decomposition Barrier. FOCS Andrew V. Goldberg, Satish Rao
1997	J	`jnl`	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1997	J	`jnl`	Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. J. Comput. Syst. Sci. Charles E. Leiserson, Satish Rao, Sivan Toledo
1997	A*	`conf`	Fast Approximate Graph Partitioning Algorithms. SODA Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1997	J	`jnl`	Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
1997	A*	`conf`	Flows in Undirected Unit Capacity Networks. FOCS Andrew V. Goldberg, Satish Rao
1997	J	`jnl`	New Graph Decompositions with Applications to Emulations. Theory Comput. Syst. Christos Kaklamanis, Danny Krizanc, Satish Rao
1997	—	`conf`	Spreading Metric Based Graph Partitioning Algorithms. PP Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1997	J	`jnl`	Work-preserving emulations of fixed-connection networks. J. ACM Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe
1996	B	`conf`	"Ratio regions": a technique for image segmentation. ICPR Ingemar J. Cox, Satish Rao, Yu Zhong
1996	J	`jnl`	A Maximum Likelihood Stereo Algorithm. Comput. Vis. Image Underst. Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs
1996	A*	`conf`	Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
1996	B	`conf`	Towards Efficiency and Portability: Programming with the BSP Model. SPAA Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas
1995	J	`jnl`	An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. Comb. Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi
1995	A*	`conf`	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1995	A*	`conf`	Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. FOCS Milena Mihail, Christos Kaklamanis, Satish Rao
1995	—	`conf`	Efficient communication using total-exchange. IPPS Satish Rao, Torsten Suel, Thanasis Tsantilas, Mark W. Goudreau
1994	B	`conf`	An Optical Simulation of Shared Memory. SPAA Leslie Ann Goldberg, Yossi Matias, Satish Rao
1994	A*	`conf`	Faster shortest-path algorithms for planar graphs. STOC Philip N. Klein, Satish Rao, Monika Rauch, Sairam Subramanian
1994	J	`jnl`	Packet Routing and Job-Shop Scheduling in Comb. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
1994	J	`jnl`	Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao
1994	A*	`conf`	Shallow Excluded Minors and Improved Graph Decompositions. SODA Serge A. Plotkin, Satish Rao, Warren D. Smith
1993	B	`conf`	A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1993	A*	`conf`	Approximate load balancing on dynamic and asynchronous networks. STOC William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao
1993	A*	`conf`	Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) FOCS Charles E. Leiserson, Satish Rao, Sivan Toledo
1993	A*	`conf`	Excluded minors, network decomposition, and multicommodity flow. STOC Philip N. Klein, Serge A. Plotkin, Satish Rao
1993	A*	`conf`	Finding Near-Optimal Cuts: An Empirical Evaluation. SODA Kevin J. Lang, Satish Rao
1993	B	`conf`	New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. SPAA Christos Kaklamanis, Danny Krizanc, Satish Rao
1993	A*	`conf`	Universal Emulations with Sublogarithmic Slowdown FOCS Christos Kaklamanis, Danny Krizanc, Satish Rao
1992	A*	`conf`	Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) STOC Satish Rao
1992	B	`conf`	Simple Path Selection for Optimal Routing on Processor Arrays. SPAA Christos Kaklamanis, Danny Krizanc, Satish Rao
1992	A	`conf`	Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution. BMVC Ingemar J. Cox, Sunita L. Hingorani, Bruce M. Maggs, Satish Rao
1990	A*	`conf`	Approximation through Multicommodity Flow FOCS Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao
1990	A*	`conf`	Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) FOCS Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
1989	A*	`conf`	Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) STOC Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg
1988	A*	`conf`	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms FOCS Frank Thomson Leighton, Satish Rao
1988	A*	`conf`	Universal Packet Routing Algorithms (Extended Abstract) FOCS Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
1987	A*	`conf`	Finding Near Optimal Separators in Planar Graphs FOCS Satish Rao