1. J. A. Abbott, Factorization of Polynomials Over Algebraic Nubmer Fields, PhD thesis, University of Bath, Bath, 1989.
2. J. A. Abbott, Recovery of algebraic numbers from their p-adic approximations, in “Proc. ISSAC’ 89,” ACM, 1989, pp. 112-120.
3. J. A. Abbott, R. J. Bradford, and J. H. Davenport, The Bath algebraic number package, in “Proc. SYMSAC’ 86,” ACM, 1986, pp. 250-253.
4. J. A. Abbott and J. H. Davenport, Polynomial factorization: an exploration of Lenstra’s algorithm, in “Proc. EUROCAL’ 87,” J. H. Davenport, editor; Lecture Notes in Computer Science 378, Springer-Verlag, Berlin-Heidelberg-New York, 1989, pp. 391-402.
5. A. Aho, J. E. Hopcroft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, Reading, Mass., 1974.