Factoring univariate polynomials over the rationals (abstract only). - Andrew Novocin (ACM Commun. Comput. Algebra, 2008)

Factoring univariate polynomials over the rationals. - Andy Novocin; Mark van Hoeij (ACM Commun. Comput. Algebra, 2008)

Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic. - William Hart; Andrew Novocin (CASC, 2011)

Practical polynomial factoring in polynomial time. - William Hart; Mark van Hoeij; Andrew Novocin (ISSAC, 2011)

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. - Andrew Novocin; Damien Stehlé; Gilles Villard (STOC, 2011)

Fast computation of Smith forms of sparse matrices over local rings. - Mustafa Elsheikh; Mark Giesbrecht; Andy Novocin; B. David Saunders (ISSAC, 2012)

Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. - Mark van Hoeij; Andrew Novocin (Algorithmica, 2012)

Generating subfields. - Mark van Hoeij; Jürgen Klüners; Andrew Novocin (J. Symb. Comput., 2013)

Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices. - Mustafa Elsheikh; Andy Novocin; Mark Giesbrecht (CoRR, 2014)

3-ranks for strongly regular graphs. - Andrew Novocin; David Saunders 002; Alexander Stachnik; Bryan S. Youse (PASCO, 2015)