1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick and T. Przytycka, "A simple parallel tree contraction algorithm", J. Algorithms, 10 (1989), pp.287–302.
2. R. Cole and U. Vishkin, "The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time", Algorithmica, 3 (1988a), pp. 329–346.
3. R. Cole and U. Vishkin, "Faster optimal parallel prefix sums and list ranking", Inform. and Comput., 81 (1989), pp.334–352.
4. H. Gazit, G.L. Miller and S.H. Teng, "Optimal tree contraction in an EREW model", in S.K. Tewkesbury, B.W. Dickinson and S.C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture and Technology, Plenum Press, New York, 1988.
5. A. Gibbons and W. Rytter, "Efficient parallel algorithms", Cambridge University Press, Cambridge, 1988.