1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. On finding lowest common ancestor in trees. SIAM Journal on computing, 5(1):115–132, 1976. See also STOC 1973.
3. S. Alstrup. Optimal algorithms for finding nearest common ancestors in dynamic trees. Technical Report 95-30, Department of Computer Science, University of Copenhagen, 1995.
4. H.N. Gabow. Data structure for weighted matching and nearest common ancestors with linking. In Annual ACM-SIAM Symposium on discrete algorithms (SODA), volume 1, pages 434–443, 1990.
5. H.N. Gabow and R.E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of computer and system sciences, 30(2):209–221, 1985.