( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Bounds for Oblivious Routing in the Hypercube.

, , и . Math. Syst. Theory, 24 (4): 223-232 (1991)

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.

Dimitrios Tsantilas

 

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

Efficient communication using total-exchange., , , и . IPPS, стр. 544-550. IEEE Computer Society, (1995)Portable and Efficient Parallel Computing Using the BSP Model., , , , и . IEEE Trans. Computers, 48 (7): 670-689 (1999)Tight Bounds for Oblivious Routing in the Hypercube., , и . SPAA, стр. 31-36. ACM, (1990)Tight Bounds for Oblivious Routing in the Hypercube., , и . Math. Syst. Theory, 24 (4): 223-232 (1991)Optimal Routing Algorithms for Mesh-Connected Processor Arrays., и . Algorithmica, 8 (1): 21-38 (1992)Efficient Optical Communication in Parallel Computers., и . SPAA, стр. 41-48. ACM, (1992)Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version)., , , и . SPAA, стр. 17-28. ACM, (1991)BSPlib: The BSP programming library., , , , , , , , и . Parallel Comput., 24 (14): 1947-1980 (1998)Optimal Routing Algorithms for Mesh-Connected Processor Arrays., , и . AWOC, том 319 из Lecture Notes in Computer Science, стр. 411-422. Springer, (1988)Towards Efficiency and Portability: Programming with the BSP Model., , , , и . SPAA, стр. 1-12. ACM, (1996)