From post

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.

 

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

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)Approximating Geometrical Graphs via "Spanners" and "Banyans"., и . STOC, стр. 540-550. ACM, (1998)Eigenvalue bounds, spectral partitioning, and metrical deformations via flows., , и . J. ACM, 57 (3): 13:1-13:23 (2010)Distributed algorithms for multicommodity flow problems via approximate steepest descent framework., , и . ACM Trans. Algorithms, 9 (1): 3:1-3:14 (2012)Maximal Accurate Forests from Distance Matrices., , , , , и . RECOMB, том 3909 из Lecture Notes in Computer Science, стр. 281-295. Springer, (2006)Stealthy poisoning attacks on PCA-based anomaly detectors., , , , , , , и . SIGMETRICS Perform. Evaluation Rev., 37 (2): 73-74 (2009)