1. BROWN, W.S, The Subresultant PRS Algorithm, TOMS 4 (1978) 237–249
2. MOSES, J and YUN, D.Y.Y., The EZ GCD Algorithm, Proceedings of ACM 73 (1973) 159–166
3. BROWN, W.S., On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journ A.C.M. 18 (1971) 478–504
4. COLLINS, G.E., Subresultants and reduced polynomial remainder sequences, Journ A.C.M. 14 (1967) 128–142
5. HEARN, A.C., An Improved Non-modular Polynomial GCD Algorithm, SIGSAM Bulletin, ACM 23, New York, (1972) 10–15