[1]

Aho, A. V., J. E. Hopcroft andJ. D. Ullman,*The design and analysis of computer Algorithms*, Addison Wesley, Reading, Mass. (1974).

[2]

Aho, A. V., J. E. Hopcroft andJ. D. Ullman,*On finding lowest common ancestors in tress*, Proc. 5-th ACM symp. Theory of Computing (1973), 253–265.

[3]

Emde Boas, P. Van,*An O (n log log n) On-Line Algorithm for the Insert-Extract Min Problem*, Rep. TR 74-221 Dept. of Comp. Sci., Cornell Univ., Ithaca 14853, N.Y. Dec. 1974.

[4]

Even, S. andO. Kariv,*Oral Commun.*, Berkeley, October 1975.

[5]

Fischer, M. J.,*Efficiency of equivalence algorithms*, in: R. E. Miller andJ. W. Thatcher (eds.),*Complexity of Computer Computations*, Plenum Press, New York (1972), 158–168.

[6]

Hopcroft, J. andJ. D. Ullman,*Set-merging Algorithms, SIAM J. Comput.*
**2** (Dec. 1973), 294–303.

[7]

Hunt, J. W. andT. G. Szymanski,*A fast algorithm for computing longest common subsequences*. Manuscript. Dept. Electr. Eng. Princeton Univ. Princeton, N.J. 08540. Oct. 1975.

[8]

Tarjan, R. E.,*Applications of path compression on balanced trees.* Manuscript. Stanford Oct. 75. (Submitted to*JACM*).

[9]

Tarjan, R. E.,*Efficiency of a good but non linear set union algorithm*,*J. Assoc. Comput. Mach.*
**22** (1975), 215–224.

[10]

Tarjan, R. E.,*Edge disjoint spanning trees, dominators and depth first search*, Rep. CS-74-455 (Sept. 1974), Stanford.

[11]

Wirth, N.,*The Programming Language PASCAL (revised report)*, in K. Jensen and N. Wirth*PASCAL User Manual and Report*, Lecture Notes in Computer Science 18, Springer, Berlin (1974).