( en | de | ru )

 

Disambiguation of "Rao, Satish"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient communication using total-exchange.

, , , and . IPPS, page 544-550. IEEE Computer Society, (1995)

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.

Satish Mishra

Satish Koria

Satish Sule

Satish Khurana

Satish Wakchaure

 

Other publications of authors with the same name

An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications., , , and . Combinatorica, 15 (2): 187-202 (1995)Edge Disjoint Paths in Moderately Connected Graphs., and . SIAM J. Comput., 39 (5): 1856-1887 (2010)A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 325-337. Springer, (2004)Fast phylogeny reconstruction through learning of ancestral sequences, , and . CoRR, (2008)New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning., , and . SODA, page 643-652. ACM/SIAM, (1999)Shallow Excluded Minors and Improved Graph Decompositions., , and . SODA, page 462-470. ACM/SIAM, (1994)Stealthy poisoning attacks on PCA-based anomaly detectors., , , , , , , and . SIGMETRICS Perform. Evaluation Rev., 37 (2): 73-74 (2009)Simple Path Selection for Optimal Routing on Processor Arrays., , and . SPAA, page 23-30. ACM, (1992)A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer., , , and . SPAA, page 300-309. ACM, (1993)New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies., , and . SPAA, page 325-334. ACM, (1993)