Computer algebra.

1. K. O. Geddes, S. R. Czapor and G. Labahn, Algorithms for Computer Algebra, Kluwer Academic Publishers, 1992    
2. H. Cheng and G. Labahn, “Output-sensitive Modular Algorithms for Polynomial Matrix Normal Forms”, Journal of Symbolic Computation, 42:7 (2007), 733–750      
3. B. Beckermann, G. Golub and G. Labahn, “On the Numerical Condition of a Generalized Hankel Eigenvalue Problem”, Numerische Mathematik, 106:1 (2007), 41–68      
4. B. Beckermann, G. Labahn and G. Villard, “Normal Forms for General Polynomial Matrices”, Journal of Symbolic Computation, 41:6 (2006), 708–737      

• David R. Cheriton School of Computer Science, University of Waterloo