The Computer Algebra Group at Simon Fraser

Text Size: ππππ
2023 Preprints 2022 Preprints 2021 Preprints 2020 Preprints 2019 Preprints 2018 Preprints 2017 Preprints 2016 Preprints 2015 Preprints 2014 Preprints 2013 Preprints 2012 Preprints 2011 Preprints 2010 Preprints 2009 Preprints 2008 Preprints 2007 Preprints 2006 Preprints 2005 Preprints 2004 Preprints 2003 Preprints 2002 Preprints 2001 Preprints 2000 Preprints Earliest Preprints

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