Computing polynomial LCM and GCD in lagrange basis. - Howard Cheng; George Labahn; Wei Zhou 029 (ACM Commun. Comput. Algebra, 2008)

Efficient computation of order bases. - Wei Zhou 029; George Labahn (ISSAC, 2009)

Computing minimal nullspace bases. - Wei Zhou 029; George Labahn; Arne Storjohann (ISSAC, 2012)

Efficient algorithms for order basis computation. - Wei Zhou 029; George Labahn (J. Symb. Comput., 2012)

Computing column bases of polynomial matrices. - Wei Zhou 029; George Labahn (ISSAC, 2013)

Unimodular completion of polynomial matrices. - Wei Zhou 029; George Labahn (ISSAC, 2014)

Fast and deterministic computation of the determinant of a polynomial matrix. - Wei Zhou 029; George Labahn (CoRR, 2014)

A deterministic algorithm for inverting a polynomial matrix. - Wei Zhou 029; George Labahn; Arne Storjohann (J. Complex., 2015)

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix. - George Labahn; Wei Zhou 029 (CoRR, 2016)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. - George Labahn; Vincent Neiger; Wei Zhou 029 (J. Complex., 2017)

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. - George Labahn; Vincent Neiger; Thi Xuan Vu; Wei Zhou 029 (ISSAC, 2022)