Search results for "Satish Rao"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao	l22 Spreading Metrics for Vertex Ordering Problems.	Algorithmica	2010	DBLP DOI BibTeX RDF
1	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.	Journal of Machine Learning Research - Proceedings Track	2010	DBLP BibTeX RDF
1	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue bounds, spectral partitioning, and metrical deformations via flows.	J. ACM	2010	DBLP DOI BibTeX RDF
1	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	2010	DBLP BibTeX RDF
1	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	2010	DBLP BibTeX RDF
1	Sagi Snir, Satish Rao	Quartets MaxCut: A Divide and Conquer Quartets Algorithm.	IEEE/ACM Trans. Comput. Biology Bioinform.	2010	DBLP DOI BibTeX RDF
1	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar	A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees
1	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Expander flows, geometric embeddings and graph partitioning.	J. ACM	2009	DBLP DOI BibTeX RDF	Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
1	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 Performance Evaluation Review	2009	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF	adversarial learning, principal components analysis, robust statistics, network traffic analysis
1	Sagi Snir, Tandy Warnow, Satish Rao	Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm.	Journal of Computational Biology	2008	DBLP DOI BibTeX RDF
1	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Geometry, flows, and graph-partitioning algorithms.	Commun. ACM	2008	DBLP DOI BibTeX RDF
1	Radu Mihaescu, Cameron Hill, Satish Rao	Fast phylogeny reconstruction through learning of ancestral sequences	CoRR	2008	DBLP BibTeX RDF
1	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue bounds, spectral partitioning, and metrical deformations via flows	CoRR	2008	DBLP BibTeX RDF
1	Jittat Fakcharoenphol, Satish Rao	Shortest Paths in Planar Graphs with Negative Weight Edges.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar	Approximating Metric Spaces by Tree Metrics.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao	Learning Mixtures of Product Distributions Using Correlations and Independence.	COLT	2008	DBLP BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao	Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions.	COLT	2008	DBLP BibTeX RDF
1	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.	FOCS	2008	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao	The k-traveling repairmen problem.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	vehicle routing, Traveling salesman
1	Stavros G. Kolliopoulos, Satish Rao	A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Rohit Khandekar, Satish Rao	Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.	SODA	2007	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou	A rigorous analysis of population stratification with limited data.	SODA	2007	DBLP DOI BibTeX RDF
1	Srinath Sridhar, Satish Rao, Eran Halperin	An Efficient and Accurate Graph-Based Approach to Detect Population Substructure.	RECOMB	2007	DBLP DOI BibTeX RDF
1	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE/ACM Trans. Comput. Biology Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
1	Jittat Fakcharoenphol, Satish Rao	Planar graphs, negative weight edges, shortest paths, and near linear time.	J. Comput. Syst. Sci.	2006	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Kevin Chen, Radu Mihaescu, Satish Rao	On the tandem duplication-random loss model of genome rearrangement.	SODA	2006	DBLP DOI BibTeX RDF
1	Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao	l22 spreading metrics for vertex ordering problems.	SODA	2006	DBLP DOI BibTeX RDF
1	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	ICALP	2006	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar	A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.	ICALP	2006	DBLP DOI BibTeX RDF
1	Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao	Maximal Accurate Forests from Distance Matrices.	RECOMB	2006	DBLP DOI BibTeX RDF
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
1	Shlomo Moran, Satish Rao, Sagi Snir	Using Semi-definite Programming to Enhance Supertree Resolvability.	WABI	2005	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
1	Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah	Lower Bounds for Maximum Parsimony with Gene Order Data.	Comparative Genomics	2005	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar	Approximating metrics by tree metrics.	SIGACT News	2004	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar	A tight bound on approximating arbitrary metrics by tree metrics.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
1	Satish Rao, Andréa W. Richa	New Approximation Techniques for Some Linear Ordering Problems.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao	A note on the nearest neighbor in growth-restricted metrics.	SODA	2004	DBLP DOI BibTeX RDF
1	Kevin Lang, Satish Rao	A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.	IPCO	2004	DBLP DOI BibTeX RDF
1	Kirsten Hildrum, Sean Ma, Satish Rao	Brief announcement: randomized rumor spreading with fewer phone calls.	PODC	2004	DBLP DOI BibTeX RDF	rumor spreading, gossip
1	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Expander flows, geometric embeddings and graph partitioning.	STOC	2004	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar	An improved approximation algorithm for the 0-extension problem.	SODA	2003	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao	The k-traveling repairman problem.	SODA	2003	DBLP DOI BibTeX RDF
1	Chris Harrelson, Kirsten Hildrum, Satish Rao	A polynomial-time tree decomposition to minimize congestion.	SPAA	2003	DBLP DOI BibTeX RDF	congestion, preconditioning, oblivious routing, tree decomposition
1	Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar	Paths, Trees, and Minimum Latency Tours.	FOCS	2003	DBLP DOI BibTeX RDF
1	Eyal Amir, Robert Krauthgamer, Satish Rao	Constant factor approximation of vertex-cuts in planar graphs.	STOC	2003	DBLP DOI BibTeX RDF	balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph
1	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar	A tight bound on approximating arbitrary metrics by tree metrics.	STOC	2003	DBLP DOI BibTeX RDF	metrics, embeddings, tree metrics
1	Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao	Distributed object location in a dynamic network.	SPAA	2002	DBLP DOI BibTeX RDF	DOLR, distributed object location, tapestry, peer-to-peer, networking, locality, DHT, distributed hash table, nearest neighbor, overlay
1	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.	2001	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Satish Rao	Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.	FOCS	2001	DBLP DOI BibTeX RDF
1	Monika Rauch Henzinger, Satish Rao, Harold N. Gabow	Computing Vertex Connectivity: New Bounds from Old Techniques.	J. Algorithms	2000	DBLP DOI BibTeX RDF
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-conquer approximation algorithms via spreading metrics.	J. ACM	2000	DBLP DOI BibTeX RDF	feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement
1	Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao	Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.	INFOCOM	2000	DBLP BibTeX RDF
1	Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas	Portable and Efficient Parallel Computing Using the BSP Model.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Satish Rao	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.	J. ACM	1999	DBLP DOI BibTeX RDF	muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
1	Andrew V. Goldberg, Satish Rao	Flows in Undirected Unit Capacity Networks.	SIAM J. Discrete Math.	1999	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Yossi Matias, Satish Rao	An Optical Simulation of Shared Memory.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Fast Approximate Graph Partitioning Algorithms.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Satish Rao	A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.	ESA	1999	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Satish Rao, Aravind Srinivasan	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.	SODA	1999	DBLP DOI BibTeX RDF
1	Satish Rao	Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics.	Symposium on Computational Geometry	1999	DBLP DOI BibTeX RDF
1	Mark W. Goudreau, Kevin Lang, Girija J. Narlikar, Satish Rao	BOS is Boss: A Case for Bulk-Synchronous Object Systems.	SPAA	1999	DBLP DOI BibTeX RDF
1	Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling	BSPlib: The BSP programming library.	Parallel Computing	1998	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	J. ACM	1998	DBLP DOI BibTeX RDF	combinatorial optimization, maximum flows
1	Satish Rao, Andréa W. Richa	New Approximation Techniques for Some Ordering Problems.	SODA	1998	DBLP DOI BibTeX RDF
1	Sanjeev Arora, Prabhakar Raghavan, Satish Rao	Approximation Schemes for Euclidean k-Medians and Related Problems.	STOC	1998	DBLP DOI BibTeX RDF
1	Satish Rao, Warren D. Smith	Approximating Geometrical Graphs via "Spanners" and "Banyans".	STOC	1998	DBLP DOI BibTeX RDF
1	Johnny Wong, Satish Rao, Naveen Ramaiah	A Multimedia Presentation Toolkit for the World Wide Web.	Softw., Pract. Exper.	1997	DBLP DOI BibTeX RDF
1	Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos	Approximation Algorithms for Steiner and Directed Multicuts.	J. Algorithms	1997	DBLP DOI BibTeX RDF
1	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	1997	DBLP DOI BibTeX RDF	parallel architectures, graph embeddings, processor arrays, network emulations
1	Christos Kaklamanis, Danny Krizanc, Satish Rao	New Graph Decompositions with Applications to Emulations.	Theory Comput. Syst.	1997	DBLP DOI BibTeX RDF
1	Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian	Faster Shortest-Path Algorithms for Planar Graphs.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Charles E. Leiserson, Satish Rao, Sivan Toledo	Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers.	SIAM J. Comput.	1997	DBLP DOI BibTeX RDF
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Fast Approximate Graph Partitioning Algorithms.	SODA	1997	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	FOCS	1997	DBLP DOI BibTeX RDF	flow decomposition barrier, arc lengths, Gomory-Hu tree problem, parametric flow problem, time bound, time bounds, combinatorial mathematics, maximum flow problem
1	Andrew V. Goldberg, Satish Rao	Flows in Undirected Unit Capacity Networks.	FOCS	1997	DBLP DOI BibTeX RDF	undirected unit capacity networks, undirected networks, graph theory, computation time, maximum flows
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Spreading Metric Based Graph Partitioning Algorithms.	PPSC	1997	DBLP BibTeX RDF
1	Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs	A Maximum Likelihood Stereo Algorithm.	Computer Vision and Image Understanding	1996	DBLP DOI BibTeX RDF
1	Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas	Towards Efficiency and Portability: Programming with the BSP Model.	SPAA	1996	DBLP BibTeX RDF
1	Monika Rauch Henzinger, Satish Rao, Harold N. Gabow	Computing Vertex Connectivity: New Bounds from Old Techniques.	FOCS	1996	DBLP DOI BibTeX RDF	smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity
1	Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi	An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	Satish Rao, Torsten Suel, Thanasis Tsantilas, Mark W. Goudreau	Efficient communication using total-exchange. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	architecture-independent programming language, logical parallelism, balanced communication patterns, N-processor network, parallel processing, parallel programming, parallel programs, parallel computing, protocols, protocols, h-relation
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
1	Milena Mihail, Christos Kaklamanis, Satish Rao	Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.	FOCS	1995	DBLP DOI BibTeX RDF	efficient access, optical bandwidth wavelength routing, directed fiber trees, directed graph models, trees of rings, fiber links, physical directedness, optical amplifiers, polynomial time routing algorithm, optical wavelengths, fixed W wavelength technology, optical routing requirements, coloring paradigms, multicolored alternating cycles, averaging analysis, directed graphs, trees (mathematics), wavelength division multiplexing, wavelength division multiplexing, graph colouring, optical communication, approximation factor, WDM optical networks, ring topologies, tree topologies
1	Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao	Randomized Routing and Sorting on Fixed-Connection Networks.	J. Algorithms	1994	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Bruce M. Maggs, Satish Rao	Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps.	Combinatorica	1994	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Satish Rao, Warren D. Smith	Shallow Excluded Minors and Improved Graph Decompositions.	SODA	1994	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Yossi Matias, Satish Rao	An Optical Simulation of Shared Memory.	SPAA	1994	DBLP DOI BibTeX RDF
1	Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian	Faster shortest-path algorithms for planar graphs.	STOC	1994	DBLP DOI BibTeX RDF
1	Kevin Lang, Satish Rao	Finding Near-Optimal Cuts: An Empirical Evaluation.	SODA	1993	DBLP DOI BibTeX RDF
1	Christos Kaklamanis, Danny Krizanc, Satish Rao	New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.	SPAA	1993	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao	A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.	SPAA	1993	DBLP DOI BibTeX RDF
1	Charles E. Leiserson, Satish Rao, Sivan Toledo	Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	elliptic solver, blocking covers, sparse linear relaxation problems, primary memory, multigrid algorithm, iteration, out-of-core algorithms, numerical computation, linear relaxation
1	Christos Kaklamanis, Danny Krizanc, Satish Rao	Universal Emulations with Sublogarithmic Slowdown	FOCS	1993	DBLP DOI BibTeX RDF	arbitrary bounded degree networks, universal emulations, sublogarithmic slowdown, bounded degree networks, area-universal network, VLSI layout area, N-node network, sublogarithmic bounds, hypercube, butterfly
1	Philip N. Klein, Serge A. Plotkin, Satish Rao	Excluded minors, network decomposition, and multicommodity flow.	STOC	1993	DBLP DOI BibTeX RDF

Publications of "Satish Rao" ( http://dblp.L3S.de/Authors/Satish_Rao )