Andrew Novocin

According to our database, Andrew Novocin authored at least 10 papers between 2008 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2015

3-ranks for strongly regular graphs.

Andrew Novocin, David Saunders, Alexander Stachnik, Bryan S. Youse

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

2014

Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices.

Mustafa Elsheikh, Andy Novocin, Mark Giesbrecht

CoRR, 2014

2013

Generating subfields.

Mark van Hoeij, Jürgen Klüners, Andrew Novocin

J. Symb. Comput., 2013

2012

Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials.

Mark van Hoeij, Andrew Novocin

Algorithmica, 2012

Fast computation of Smith forms of sparse matrices over local rings.

Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract.

Andrew Novocin, Damien Stehlé, Gilles Villard

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Practical polynomial factoring in polynomial time.

William Hart, Mark van Hoeij, Andrew Novocin

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic.

William Hart, Andrew Novocin

Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2008

Factoring univariate polynomials over the rationals.

Andy Novocin, Mark van Hoeij

ACM Commun. Comput. Algebra, 2008

Factoring univariate polynomials over the rationals (abstract only).

Andrew Novocin

ACM Commun. Comput. Algebra, 2008