default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatish Rao
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c77]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA 2024: 3089-3139- [i12]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR abs/2401.05627 (2024) - [i11]Jason Li, Satish Rao, Di Wang:
Congestion-Approximators from the Bottom Up. CoRR abs/2407.04976 (2024) - 2021
- [j47]Thien Le
, Aaron Sy, Erin K. Molloy, Qiuyi 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): 2-15 (2021) - 2020
- [j46]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. SIAM J. Comput. 49(1): 1-36 (2020)
2010 – 2019
- 2019
- [j45]Qiuyi 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): 2:1-2:12 (2019) - [c76]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: 167-178 - 2018
- [c75]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. SODA 2018: 1577-1584 - [c74]Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow:
New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. WABI 2018: 8:1-8:12 - 2017
- [c73]Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao:
Capacity Releasing Diffusion for Speed and Locality. ICML 2017: 3598-3607 - [c72]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. SODA 2017: 1919-1938 - [c71]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly refuting random CSPs below the spectral threshold. STOC 2017: 121-131 - [i10]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. CoRR abs/1704.01254 (2017) - [i9]Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao:
Capacity Releasing Diffusion for Speed and Locality. CoRR abs/1706.05826 (2017) - [i8]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. CoRR abs/1708.01632 (2017) - 2016
- [j44]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: 435 (2016) - [c70]Di Wang, Satish Rao, Michael W. Mahoney:
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. ICALP 2016: 50:1-50:13 - [c69]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: 52:1-52:14 - [r4]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2016: 113-116 - [r3]Jittat Fakcharoenphol, Satish Rao:
Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms 2016: 1971-1974 - [i7]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR abs/1605.00058 (2016) - 2015
- [i6]Di Wang, Satish Rao, Michael W. Mahoney:
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. CoRR abs/1508.02439 (2015) - [i5]Di Wang, Michael W. Mahoney, Nishanth Mohan, Satish Rao:
Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent. CoRR abs/1511.06468 (2015) - 2013
- [j43]Radu Mihaescu, Cameron Hill, Satish Rao:
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. Algorithmica 66(2): 419-449 (2013) - [c68]Yin Tat Lee, Satish Rao, Nikhil Srivastava:
A new approach to computing maximum flows using electrical flows. STOC 2013: 755-764 - 2012
- [j42]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: 1293-1332 (2012) - [j41]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms 9(1): 3:1-3:14 (2012) - 2010
- [j40]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010) - [j39]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. J. ACM 57(3): 13:1-13:23 (2010) - [j38]Satish Rao, Shuheng Zhou:
Edge Disjoint Paths in Moderately Connected Graphs. SIAM J. Comput. 39(5): 1856-1887 (2010) - [j37]Sagi Snir, Satish Rao:
Quartets MaxCut: A Divide and Conquer Quartets Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 704-718 (2010) - [c67]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: 549-556 - [i4]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 abs/1003.2751 (2010) - [i3]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 abs/1007.0484 (2010)
2000 – 2009
- 2009
- [j36]Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar:
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Algorithmica 55(1): 157-189 (2009) - [j35]Sanjeev Arora, Satish Rao, Umesh V. Vazirani:
Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2): 5:1-5:37 (2009) - [j34]Rohit Khandekar, Satish Rao, Umesh V. Vazirani:
Graph partitioning using single commodity flows. J. ACM 56(4): 19:1-19:15 (2009) - [j33]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): 73-74 (2009) - [j32]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): 4489-4503 (2009) - [c66]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: 1-14 - 2008
- [j31]Sanjeev Arora, Satish Rao, Umesh V. Vazirani:
Geometry, flows, and graph-partitioning algorithms. Commun. ACM 51(10): 96-105 (2008) - [j30]Sagi Snir, Tandy J. Warnow, Satish Rao:
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. J. Comput. Biol. 15(1): 91-103 (2008) - [c65]Kamalika Chaudhuri, Satish Rao:
Learning Mixtures of Product Distributions Using Correlations and Independence. COLT 2008: 9-20 - [c64]Kamalika Chaudhuri, Satish Rao:
Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. COLT 2008: 21-32 - [c63]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. FOCS 2008: 751-760 - [r2]Jittat Fakcharoenphol, Satish Rao:
Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms 2008 - [r1]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2008 - [i2]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. CoRR abs/0808.0148 (2008) - [i1]Radu Mihaescu, Cameron Hill, Satish Rao:
Fast phylogeny reconstruction through learning of ancestral sequences. CoRR abs/0812.1587 (2008) - 2007
- [j29]Stavros G. Kolliopoulos, Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. 37(3): 757-782 (2007) - [j28]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairmen problem. ACM Trans. Algorithms 3(4): 40 (2007) - [c62]Srinath Sridhar, Satish Rao, Eran Halperin:
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. RECOMB 2007: 503-517 - [c61]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957 - [c60]Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou:
A rigorous analysis of population stratification with limited data. SODA 2007: 1046-1055 - 2006
- [j27]Jittat Fakcharoenphol, Satish Rao:
Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5): 868-889 (2006) - [j26]Sagi Snir, Satish Rao:
Using Max Cut to Enhance Rooted Trees Consistency. IEEE ACM Trans. Comput. Biol. Bioinform. 3(4): 323-333 (2006) - [c59]Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar:
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. ICALP (1) 2006: 191-201 - [c58]Satish Rao, Shuheng Zhou:
Edge Disjoint Paths in Moderately Connected Graphs. ICALP (1) 2006: 202-213 - [c57]Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao:
Maximal Accurate Forests from Distance Matrices. RECOMB 2006: 281-295 - [c56]Kamalika Chaudhuri, Kevin C. Chen, Radu Mihaescu, Satish Rao:
On the tandem duplication-random loss model of genome rearrangement. SODA 2006: 564-570 - [c55]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 - [c54]Rohit Khandekar, Satish Rao, Umesh V. Vazirani:
Graph partitioning using single commodity flows. STOC 2006: 385-390 - 2005
- [c53]Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar:
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. APPROX-RANDOM 2005: 26-39 - [c52]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: 1-10 - [c51]Shlomo Moran, Satish Rao, Sagi Snir:
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103 - 2004
- [j25]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3): 485-497 (2004) - [j24]Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed Object Location in a Dynamic Network. Theory Comput. Syst. 37(3): 405-440 (2004) - [j23]Satish Rao, Andréa W. Richa:
New Approximation Techniques for Some Linear Ordering Problems. SIAM J. Comput. 34(2): 388-404 (2004) - [j22]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating metrics by tree metrics. SIGACT News 35(2): 60-70 (2004) - [c50]Kevin J. Lang, Satish Rao:
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. IPCO 2004: 325-337 - [c49]Kirsten Hildrum, Sean Ma, Satish Rao:
Brief announcement: randomized rumor spreading with fewer phone calls. PODC 2004: 380 - [c48]Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao:
A note on the nearest neighbor in growth-restricted metrics. SODA 2004: 560-561 - [c47]Sanjeev Arora, Satish Rao, Umesh V. Vazirani:
Expander flows, geometric embeddings and graph partitioning. STOC 2004: 222-231 - 2003
- [c46]Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar:
Paths, Trees, and Minimum Latency Tours. FOCS 2003: 36-45 - [c45]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar:
An improved approximation algorithm for the 0-extension problem. SODA 2003: 257-265 - [c44]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairman problem. SODA 2003: 655-664 - [c43]Chris Harrelson, Kirsten Hildrum, Satish Rao:
A polynomial-time tree decomposition to minimize congestion. SPAA 2003: 34-43 - [c42]Eyal Amir, Robert Krauthgamer, Satish Rao:
Constant factor approximation of vertex-cuts in planar graphs. STOC 2003: 90-99 - [c41]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics. STOC 2003: 448-455 - 2002
- [c40]Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed object location in a dynamic network. SPAA 2002: 41-52 - 2001
- [j21]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): 626-641 (2001) - [c39]Jittat Fakcharoenphol, Satish Rao:
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS 2001: 232-241 - 2000
- [j20]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4): 585-616 (2000) - [j19]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000) - [c38]Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao:
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM 2000: 1624-1643
1990 – 1999
- 1999
- [j18]Frank Thomson Leighton, Satish Rao:
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6): 787-832 (1999) - [j17]Leslie Ann Goldberg, Yossi Matias, Satish Rao:
An Optical Simulation of Shared Memory. SIAM J. Comput. 28(5): 1829-1847 (1999) - [j16]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. 28(6): 2187-2214 (1999) - [j15]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. 12(1): 1-5 (1999) - [j14]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): 670-689 (1999) - [c37]Satish Rao:
Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. SCG 1999: 300-306 - [c36]Stavros G. Kolliopoulos, Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA 1999: 378-389 - [c35]Frank Thomson Leighton, Satish Rao, Aravind Srinivasan:
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA 1999: 643-652 - [c34]Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao:
BOS is Boss: A Case for Bulk-Synchronous Object Systems. SPAA 1999: 115-125 - 1998
- [j13]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. J. ACM 45(5): 783-797 (1998) - [j12]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): 1947-1980 (1998) - [c33]Tom Leighton, Satish Rao, Aravind Srinivasan:
Multicommodity Flow and Circuit Switching. HICSS (7) 1998: 459-465 - [c32]Satish Rao, Andréa W. Richa:
New Approximation Techniques for Some Ordering Problems. SODA 1998: 211-218 - [c31]Sanjeev Arora, Prabhakar Raghavan, Satish Rao:
Approximation Schemes for Euclidean k-Medians and Related Problems. STOC 1998: 106-113 - [c30]Satish Rao, Warren D. Smith:
Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC 1998: 540-550 - 1997
- [j11]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe:
Work-preserving emulations of fixed-connection networks. J. ACM 44(1): 104-147 (1997) - [j10]Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos:
Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22(2): 241-269 (1997) - [j9]Charles E. Leiserson, Satish Rao, Sivan Toledo:
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. J. Comput. Syst. Sci. 54(2): 332-344 (1997) - [j8]Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian:
Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997) - [j7]Christos Kaklamanis, Danny Krizanc, Satish Rao:
New Graph Decompositions with Applications to Emulations. Theory Comput. Syst. 30(1): 39-49 (1997) - [j6]Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao:
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26(4): 1100-1119 (1997) - [j5]Johnny Wong, Satish Rao, Naveen Ramaiah:
A Multimedia Presentation Toolkit for the World Wide Web. Softw. Pract. Exp. 27(4): 425-446 (1997) - [c29]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. FOCS 1997: 2-11 - [c28]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. FOCS 1997: 32-34 - [c27]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms. PP 1997 - [c26]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SODA 1997: 639-648 - 1996
- [j4]Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs:
A Maximum Likelihood Stereo Algorithm. Comput. Vis. Image Underst. 63(3): 542-567 (1996) - [c25]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471 - [c24]Ingemar J. Cox, Satish Rao, Yu Zhong:
"Ratio regions": a technique for image segmentation. ICPR 1996: 557-564 - [c23]Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas:
Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996: 1-12 - 1995
- [j3]Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi:
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. Comb. 15(2): 187-202 (1995) - [c22]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS 1995: 62-71 - [c21]Milena Mihail, Christos Kaklamanis, Satish Rao:
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. FOCS 1995: 548-557 - [c20]