( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.

, , и . FOCS, стр. 548-557. 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.

Satish Mishra

Satish Koria

Satish Sule

Satish Khurana

Satish Mishra

 

Другие публикации лиц с тем же именем

Stealthy poisoning attacks on PCA-based anomaly detectors., , , , , , , и . SIGMETRICS Perform. Evaluation Rev., 37 (2): 73-74 (2009)A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer., , , и . SPAA, стр. 300-309. ACM, (1993)New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies., , и . SPAA, стр. 325-334. ACM, (1993)An Optical Simulation of Shared Memory., , и . SPAA, стр. 257-267. ACM, (1994)Simple Path Selection for Optimal Routing on Processor Arrays., , и . SPAA, стр. 23-30. ACM, (1992)Graph partitioning using single commodity flows., , и . STOC, стр. 385-390. ACM, (2006)A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts., и . IPCO, том 3064 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2004)Edge Disjoint Paths in Moderately Connected Graphs., и . SIAM J. Comput., 39 (5): 1856-1887 (2010)New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning., , и . SODA, стр. 643-652. ACM/SIAM, (1999)Shallow Excluded Minors and Improved Graph Decompositions., , и . SODA, стр. 462-470. ACM/SIAM, (1994)