Computational Algebra Group at SFU

2010 Preprints

Mahdi Javadi and Michael Monagan. Parallel Sparse Polynomial Interpolation over Finite Fields.
Submitted April 2010 to PASCO '10. [ PDF ]

Michael Monagan and Roman Pearce. Parallel Sparse Polynomial Division Using Heaps.
Submitted April 2010 to PASCO '10. [ PDF ]

Andrew Arnold and Michael Monagan. High performance algorithms for computing cyclotomic polynomials.
Submitted April 2010 to PASCO '10. [ PDF ]

Michael Monagan and Roman Pearce. Sparse Polynomial Multiplication and Division in Maple 14.
Submitted April 2010 to the ISSAC '10 software presentation session. [ PDF ]

Mahdi Javadi and Michael Monagan. On Sparse Interpolation over Finite Fields. [ PDF ]
Poster, MITACS 2010, Edmonton, Alberta, May 2010.
Poster, ISSAC 2010, Munich, Germany, July 2010.
Poster, Computers and Mathematics day, SFU, Vancouver, August 12th, 2010.

Andrew Arnold and Michael Monagan. A fast recursive algorithm for computing cyclotomic polynomials. [ PDF ]
Poster, ANTS 2010, Nancy, France, July 2010.
Poster, ISSAC 2010, Munich, Germany, July 2010.
Poster, Computers and Mathematics day, SFU, Vancouver, August 12th, 2010.

Cory Ahn and Michael Monagan. Multiplication of univariate polynomials over algebraic number fields. [ PDF ]
Poster, Computers and Mathematics day, SFU, Vancouver, August 12th, 2010.

Stephen Melczer, Michael Monagan and Roman Pearce. Prime Decomposition of Ideals in Polynomial Rings. [ PDF ]
Poster, Computers and Mathematics day, SFU, Vancouver, August 12th, 2010.

Andrew Arnold and Michael Monagan. Calculating Cyclotomic Polynomials.
Accepted July 2010 for Mathematics of Computation. [ PDF ]

Mahdi Javadi and Michael Monagan. Parallel Sparse Interpolation over Finite Fields.
Submitted November 2010 to the Journal of Symbolic Computation. [ PDF ]

Back to the CAG Home Page