1. K. Abrahamson, N. Dadoun, D. Kirkpatrick, and T. Prsytycka, ”A simple Parallel Tree Construction Algorithm,” Journal of Algorithms, 10, pp.287–302, 1989.
2. K. W. Chong and T. W. Lam, ”Finding Connected Components in O(lognloglogn) Time on the EREW PRAM,” SODA, 1993.
3. R. Cole and U. Vishkin, ”Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking,” AWOC pp.91–100, 1988.
4. E. Dekel and J. Hu, ”A Parallel Algorithm for Finding Minimum Cutsets in Reduceble graphs,” Journal of Parallel and Distributed Processing, to appear.
5. S. Ntafos, E. Dekel and S. Peng, ”Compression Trees and Their Applications,” Proc. ICPP, pp.132–139, 1987.