1. Improved processor bounds for parallel algorithms for weighted directed graphs;Amato;Inform. Process. Lett.,1993
2. D. Bader, A practical parallel algorithm for cycle detection in partitioned digraphs, Technical Report AHPCC-TR-99-013, University of New Mexico, Albuquerque, NM, 1999.
3. A.H. Baker, S. Crivelli, E.R. Jessup, An efficient parallel termination detection algorithm, Technical Report CU-CS-915-01, University of Colorado, 2001.
4. Massively parallel computing using commodity components;Brightwell;Parallel Comput.,2000
5. Faster optimal parallel prefix sums and list ranking;Cole;Inform. Comput.,1989