# Computational Algebra Group at SFU

# 2015 Preprints, Posters and Theses

Alan Wong

Heuristics and Identities for Computing the Tutte polynomial.

[ Honours Thesis ] December 2015.

Adriano Aarce, Michael Monagan and Hao Zhuang

Sparse Polynomial Interpolation via Discrete Logarithms.

[ Poster: PDF ]
Symposium on Mathematics and Computation, SFU, August 6th, 2015.

John Kluesner

Computing GCDs of polynomials over univariate quotient rings.

[ Poster: PDF ]
Symposium on Mathematics and Computation, SFU, August 6th, 2015.

Matthew Gibson and Michael Monagan.

Optimizing and Parallelizing the Modular GCD Algorithm.

[ Preprint: PDF ]
Accepted for PASCO 2015, Bath, England, July, 2015.

Marshall Law and Michael Monagan

A parallel implementation for polynomial multiplication modular a prime.

[ Preprint: PDF ]
Accepted for PASCO 2015, Bath, England, July, 2015.

Michael Monagan and Roman Pearce

Preprint: A Compact Parallel Implementation of F4

Accepted for PASCO 2015, Bath, England, July, 2015.

Back to the CAG Home Page