1. Polynomial and Matrix Computations
2. Eberly, W. and Giesbrecht, M. “Efficient decomposition of associative algebras”. ISSAC1996: Proceedings of the International Symposium on Symbolic and Algebraic. Edited by: Lakshman, Y. N. pp.170–178. New York: ACM Press. [Eberly and Giesbrecht 1996], Computation (Zurich, 1996)
3. Nearly Optimal Algorithms for Canonical Matrix Forms
4. Testing modules for irreducibility