1. Abdeljaoued, J.: Berkowitz Algorithm, Maple and computing the characteristic polynomial in an arbitrary commutative ring. Computer Algebra MapleTech 4, No. 3, Birkhauser Boston (1997)
2. Abdeljaoued, J., Malaschonok, G. I.: Efficient Algorithms for Computing the Characteristic Polynomial in a Domain. Journal of Pure and Applied Algebra (to appear)
3. Akritas, A. G., Akritas, E. K., Malaschonok, G. I.: Various proofs of Sylvester’s (determinant) identity. Mathematics and Computations in Simulation 42 (1996) 585–593
4. Akritas, A. G., Akritas, E. K., Malaschonok, G. I.: Matrix computation of subresultant polynomial remainder sequences in integral domain. Reliable Computing 1, No. 4 (1995) 375–381
5. Bareiss, E. H.: Sylvester’s Identity and Multistep Integer-Preserving Gaussian Elimination. Math. Comp. 22 (103) (1968) 565–578