Author of the publication

Finding Connected Components in O(log n log log n) Time on the EREW PRAM.

, and . J. Algorithms, 18 (3): 378-402 (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.

 

Other publications of authors with the same name

Approximating Biconnectivity in Parallel., and . Algorithmica, 21 (4): 395-410 (1998)Finding Connected Components in O(log n log log n) Time on the EREW PRAM., and . SODA, page 11-20. ACM/SIAM, (1993)Improving the efficiency of parallel minimum spanning tree algorithms., , , and . Discret. Appl. Math., 126 (1): 33-54 (2003)Improving Parallel Computation with Fast Integer Sorting., , , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 452-461. Springer, (1999)Concurrent threads and optimal parallel minimum spanning trees algorithm., , and . J. ACM, 48 (2): 297-323 (2001)An Optimal Parallel Co-Connectivity Algorithm., , and . Theory Comput. Syst., 37 (4): 527-546 (2004)Improved algorithms for some classical graph problems. University of Hong Kong, (1996)Improved Deterministic Parallel Padded Sorting., and . ESA, volume 1461 of Lecture Notes in Computer Science, page 405-416. Springer, (1998)On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees., , and . SODA, page 225-234. ACM/SIAM, (1999)Towards More Precise Parallel Biconnectivity Approximation., and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 223-232. Springer, (1996)