1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin, “Parallel construction of a suffix tree with applications”, to appear in Algorithmica special issue on parallel and distributed computing.
3. R. Cole and U. Vishkin, “Approximate and exact parallel scheduling with applications to list, tree and graph problems”, Proc. 27th Annual Symp. on Foundations of Computer Science, (1986), pp. 478–491.
4. R. Cole and U. Vishkin, “Faster optimal parallel prefix sums and list ranking”, TR 56/86, the Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1986).
5. D. Harel and R.E. Tarjan, “Fast algorithms for finding nearest common ancestors”, SIAM J. Comput., 13 (1984), pp. 338–355.