Author of the publication

Finding strongly connected components in distributed graphs.

, , , and . J. Parallel Distributed Comput., 65 (8): 901-910 (2005)

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

A Hybrid Approach to Proving Memory Reference Monotonicity., and . LCPC, volume 7146 of Lecture Notes in Computer Science, page 61-75. Springer, (2011)Finding strongly connected components in distributed graphs., , , and . J. Parallel Distributed Comput., 65 (8): 901-910 (2005)Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony., , , , and . LCPC, volume 10136 of Lecture Notes in Computer Science, page 40-54. Springer, (2016)Principles of Speculative Run-Time Parallelization., and . LCPC, volume 1656 of Lecture Notes in Computer Science, page 323-337. Springer, (1998)The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization., and . IEEE Trans. Parallel Distributed Syst., 10 (2): 160-180 (1999)Logical inference techniques for loop parallelization., and . PLDI, page 509-520. ACM, (2012)The STAPL pArray., , , and . MEDEA@PACT, page 73-80. ACM, (2007)Measuring limits of parallelism and characterizing its vulnerability to resource constraints., , and . MICRO, page 105-117. ACM / IEEE Computer Society, (1993)STAPL-RTS: An Application Driven Runtime System., , , , and . ICS, page 425-434. ACM, (2015)STAPL: standard template adaptive parallel library., , , , , , , , , and 1 other author(s). SYSTOR, ACM, (2010)