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.

 

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

Optimal parallel selection.. ACM Trans. Algorithms, 3 (4): 38 (2007)An Efficient Parallel Algorithm for Building the Separating Tree.. PDPTA, стр. 369-373. CSREA Press, (2006)Improved algorithm for all pairs shortest paths.. Inf. Process. Lett., 91 (5): 245-250 (2004)A note of an O(n3/logn) time algorithm for all pairs shortest paths.. Inf. Process. Lett., 105 (3): 114-116 (2008)A Linear Time Algorithm for Ordered Partition.. FAW, том 9130 из Lecture Notes in Computer Science, стр. 89-103. Springer, (2015)An O(n3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths.. ESA, том 4168 из Lecture Notes in Computer Science, стр. 411-417. Springer, (2006)An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths., и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 131-141. Springer, (2012)Optimal Parallel Algorithms for Multiselection on Mesh-Connected Computers., , , и . Int. J. Comput. Math., 80 (2): 165-179 (2003)Finding Test-and-Treatment Procedures Using Parallel Computation., , , и . J. Parallel Distributed Comput., 4 (3): 309-318 (1987)An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations., , и . CATA, том 58 из EPiC Series in Computing, стр. 93-98. EasyChair, (2019)