The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Satish Rao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian
    Faster shortest-path algorithms for planar graphs. [Citation Graph (2, 0)][DBLP]
    STOC, 1994, pp:27-37 [Conf]
  2. Charles E. Leiserson, Satish Rao, Sivan Toledo
    Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1993, pp:704-713 [Conf]
  3. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (1, 0)][DBLP]
    SODA, 1997, pp:639-648 [Conf]
  4. Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas
    Towards Efficiency and Portability: Programming with the BSP Model. [Citation Graph (1, 0)][DBLP]
    SPAA, 1996, pp:1-12 [Conf]
  5. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
    What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:26-39 [Conf]
  6. Satish Rao
    Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:300-306 [Conf]
  7. Stavros G. Kolliopoulos, Satish Rao
    A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:378-389 [Conf]
  8. Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar
    Paths, Trees, and Minimum Latency Tours. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:36-45 [Conf]
  9. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:62-71 [Conf]
  10. Jittat Fakcharoenphol, Satish Rao
    Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:232-241 [Conf]
  11. Andrew V. Goldberg, Satish Rao
    Beyond the Flow Decomposition Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:2-11 [Conf]
  12. Andrew V. Goldberg, Satish Rao
    Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:32-34 [Conf]
  13. Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
    Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:462-471 [Conf]
  14. Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
    Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:285-296 [Conf]
  15. Christos Kaklamanis, Danny Krizanc, Satish Rao
    Universal Emulations with Sublogarithmic Slowdown [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:341-350 [Conf]
  16. Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao
    Approximation through Multicommodity Flow [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:726-737 [Conf]
  17. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
    Universal Packet Routing Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:256-269 [Conf]
  18. Frank Thomson Leighton, Satish Rao
    An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:422-431 [Conf]
  19. Milena Mihail, Christos Kaklamanis, Satish Rao
    Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:548-557 [Conf]
  20. Satish Rao
    Finding Near Optimal Separators in Planar Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:225-237 [Conf]
  21. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
    A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:191-201 [Conf]
  22. Satish Rao, Shuheng Zhou
    Edge Disjoint Paths in Moderately Connected Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:202-213 [Conf]
  23. Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
    Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1624-1643 [Conf]
  24. Kevin Lang, Satish Rao
    A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:325-337 [Conf]
  25. Satish Rao, Torsten Suel, Thanasis Tsantilas, Mark W. Goudreau
    Efficient communication using total-exchange. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:544-550 [Conf]
  26. Kirsten Hildrum, Sean Ma, Satish Rao
    Brief announcement: randomized rumor spreading with fewer phone calls. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:380- [Conf]
  27. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Spreading Metric Based Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  28. Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
    Lower Bounds for Maximum Parsimony with Gene Order Data. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2005, pp:1-10 [Conf]
  29. Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao
    Maximal Accurate Forests from Distance Matrices. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:281-295 [Conf]
  30. Srinath Sridhar, Satish Rao, Eran Halperin
    An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2007, pp:503-517 [Conf]
  31. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
    l22 spreading metrics for vertex ordering problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1018-1027 [Conf]
  32. Kamalika Chaudhuri, Kevin Chen, Radu Mihaescu, Satish Rao
    On the tandem duplication-random loss model of genome rearrangement. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:564-570 [Conf]
  33. Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
    The k-traveling repairman problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:655-664 [Conf]
  34. Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
    An improved approximation algorithm for the 0-extension problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:257-265 [Conf]
  35. Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao
    A note on the nearest neighbor in growth-restricted metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:560-561 [Conf]
  36. Kevin Lang, Satish Rao
    Finding Near-Optimal Cuts: An Empirical Evaluation. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:212-221 [Conf]
  37. Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
    New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:643-652 [Conf]
  38. Serge A. Plotkin, Satish Rao, Warren D. Smith
    Shallow Excluded Minors and Improved Graph Decompositions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:462-470 [Conf]
  39. Satish Rao, Andréa W. Richa
    New Approximation Techniques for Some Ordering Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:211-218 [Conf]
  40. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:300-309 [Conf]
  41. Leslie Ann Goldberg, Yossi Matias, Satish Rao
    An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:257-267 [Conf]
  42. Mark W. Goudreau, Kevin Lang, Girija J. Narlikar, Satish Rao
    BOS is Boss: A Case for Bulk-Synchronous Object Systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:115-125 [Conf]
  43. Chris Harrelson, Kirsten Hildrum, Satish Rao
    A polynomial-time tree decomposition to minimize congestion. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:34-43 [Conf]
  44. Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao
    Distributed object location in a dynamic network. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:41-52 [Conf]
  45. Christos Kaklamanis, Danny Krizanc, Satish Rao
    Simple Path Selection for Optimal Routing on Processor Arrays. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:23-30 [Conf]
  46. Christos Kaklamanis, Danny Krizanc, Satish Rao
    New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:325-334 [Conf]
  47. Eyal Amir, Robert Krauthgamer, Satish Rao
    Constant factor approximation of vertex-cuts in planar graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:90-99 [Conf]
  48. William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao
    Approximate load balancing on dynamic and asynchronous networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:632-641 [Conf]
  49. Sanjeev Arora, Prabhakar Raghavan, Satish Rao
    Approximation Schemes for Euclidean k-Medians and Related Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:106-113 [Conf]
  50. Sanjeev Arora, Satish Rao, Umesh V. Vazirani
    Expander flows, geometric embeddings and graph partitioning. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:222-231 [Conf]
  51. Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
    A tight bound on approximating arbitrary metrics by tree metrics. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:448-455 [Conf]
  52. Rohit Khandekar, Satish Rao, Umesh V. Vazirani
    Graph partitioning using single commodity flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:385-390 [Conf]
  53. Philip N. Klein, Serge A. Plotkin, Satish Rao
    Excluded minors, network decomposition, and multicommodity flow. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:682-690 [Conf]
  54. Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg
    Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:227-240 [Conf]
  55. Satish Rao
    Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:229-240 [Conf]
  56. Satish Rao, Warren D. Smith
    Approximating Geometrical Graphs via "Spanners" and "Banyans". [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:540-550 [Conf]
  57. Shlomo Moran, Satish Rao, Sagi Snir
    Using Semi-definite Programming to Enhance Supertree Resolvability. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:89-103 [Conf]
  58. Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi
    An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:187-202 [Journal]
  59. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
    Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:167-186 [Journal]
  60. Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs
    A Maximum Likelihood Stereo Algorithm. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1996, v:63, n:3, pp:542-567 [Journal]
  61. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-conquer approximation algorithms via spreading metrics. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:4, pp:585-616 [Journal]
  62. Andrew V. Goldberg, Satish Rao
    Beyond the Flow Decomposition Barrier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:783-797 [Journal]
  63. Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe
    Work-preserving emulations of fixed-connection networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:1, pp:104-147 [Journal]
  64. Frank Thomson Leighton, Satish Rao
    Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:787-832 [Journal]
  65. Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
    Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:222-250 [Journal]
  66. Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
    Approximation Algorithms for Steiner and Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:241-269 [Journal]
  67. Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao
    Randomized Routing and Sorting on Fixed-Connection Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:1, pp:157-205 [Journal]
  68. Jittat Fakcharoenphol, Satish Rao
    Planar graphs, negative weight edges, shortest paths, and near linear time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:868-889 [Journal]
  69. Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
    A tight bound on approximating arbitrary metrics by tree metrics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:485-497 [Journal]
  70. Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
    Faster Shortest-Path Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:3-23 [Journal]
  71. Charles E. Leiserson, Satish Rao, Sivan Toledo
    Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:332-344 [Journal]
  72. Christos Kaklamanis, Danny Krizanc, Satish Rao
    New Graph Decompositions with Applications to Emulations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:1, pp:39-49 [Journal]
  73. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2187-2214 [Journal]
  74. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1100-1119 [Journal]
  75. Leslie Ann Goldberg, Yossi Matias, Satish Rao
    An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1829-1847 [Journal]
  76. Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
    New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:626-641 [Journal]
  77. Satish Rao, Andréa W. Richa
    New Approximation Techniques for Some Linear Ordering Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:388-404 [Journal]
  78. Andrew V. Goldberg, Satish Rao
    Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:1-5 [Journal]
  79. Johnny Wong, Satish Rao, Naveen Ramaiah
    A Multimedia Presentation Toolkit for the World Wide Web. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1997, v:27, n:4, pp:425-446 [Journal]
  80. Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas
    Portable and Efficient Parallel Computing Using the BSP Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:7, pp:670-689 [Journal]
  81. Sagi Snir, Satish Rao
    Using Max Cut to Enhance Rooted Trees Consistency. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:323-333 [Journal]
  82. Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou
    A rigorous analysis of population stratification with limited data. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1046-1055 [Conf]
  83. Baruch Awerbuch, Rohit Khandekar, Satish Rao
    Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:949-957 [Conf]
  84. Stavros G. Kolliopoulos, Satish Rao
    A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:757-782 [Journal]

  85. Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. [Citation Graph (, )][DBLP]


  86. Learning Mixtures of Product Distributions Using Correlations and Independence. [Citation Graph (, )][DBLP]


  87. Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. [Citation Graph (, )][DBLP]


  88. ANTIDOTE: understanding and defending against poisoning of anomaly detectors. [Citation Graph (, )][DBLP]


  89. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. [Citation Graph (, )][DBLP]


  90. l22 Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]


  91. Geometry, flows, and graph-partitioning algorithms. [Citation Graph (, )][DBLP]


  92. Eigenvalue bounds, spectral partitioning, and metrical deformations via flows [Citation Graph (, )][DBLP]


  93. Fast phylogeny reconstruction through learning of ancestral sequences [Citation Graph (, )][DBLP]


  94. Near-Optimal Evasion of Convex-Inducing Classifiers [Citation Graph (, )][DBLP]


  95. Query Strategies for Evading Convex-Inducing Classifiers [Citation Graph (, )][DBLP]


Search in 0.897secs, Finished in 0.904secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002