Author of the publication

An Efficient and Accurate Graph-Based Approach to Detect Population Substructure.

, , and . RECOMB, volume 4453 of Lecture Notes in Computer Science, page 503-517. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Rao, Satish
add a person with the name Rao, Satish
 

Other publications of authors with the same name

Query Strategies for Evading Convex-Inducing Classifiers., , , , , , and . J. Mach. Learn. Res., (2012)Distributed Object Location in a Dynamic Network., , , and . Theory Comput. Syst., 37 (3): 405-440 (2004)Beyond the Flow Decomposition Barrier., and . J. ACM, 45 (5): 783-797 (1998)Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms., and . J. ACM, 46 (6): 787-832 (1999)Expander flows, geometric embeddings and graph partitioning., , and . J. ACM, 56 (2): 5:1-5:37 (2009)Query Strategies for Evading Convex-Inducing Classifiers, , , , , , and . CoRR, (2010)Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps., , and . Combinatorica, 14 (2): 167-186 (1994)Fast Approximate Graph Partitioning Algorithms., , , and . SODA, page 639-648. ACM/SIAM, (1997)Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^-3) Time., , , and . ICALP, volume 55 of LIPIcs, page 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation., , and . INFOCOM, page 1624-1643. IEEE Computer Society, (2000)