1. Lect Notes Comput Sci;E. Caceres,1997
2. Cole, R. and Vishkin, U. (1989). Faster optimal prefix sums and list ranking. Information and Computation, 81(3):128–142.
3. Dehne, F., Fabri, A., and Rau-Chaplin, A. (1996). Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379–400.
4. Lect Notes Comput Sci;F. Dehne,1996
5. Guérin Lassous, I., Gustedt, J., and Morvan, M. (2000). Feasibility, portability, predictability and efficiency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms. Technical Report 3885, INRIA.