Rational simplification modulo a polynomial ideal. - Michael B. Monagan; Roman Pearce (ISSAC, 2006)

Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. - Michael B. Monagan; Roman Pearce (CASC, 2007)

A maple library for high performance sparse polynomial arithmetic. - Roman Pearce; Michael B. Monagan (ACM Commun. Comput. Algebra, 2007)

Parallel sparse polynomial multiplication using heaps. - Michael B. Monagan; Roman Pearce (ISSAC, 2009)

Parallel sparse polynomial division using heaps. - Michael B. Monagan; Roman Pearce (PASCO, 2010)

Sparse polynomial multiplication and division in Maple 14. - Michael B. Monagan; Roman Pearce (ACM Commun. Comput. Algebra, 2010)

Sparse polynomial division using a heap. - Michael B. Monagan; Roman Pearce (J. Symb. Comput., 2011)

Sparse Polynomial Powering Using Heaps. - Michael B. Monagan; Roman Pearce (CASC, 2012)

POLY: a new polynomial data structure for Maple 17. - Michael B. Monagan; Roman Pearce (ACM Commun. Comput. Algebra, 2012)

The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects. - Michael B. Monagan; Roman Pearce (ACM Commun. Comput. Algebra, 2014)

A compact parallel implementation of F4. - Michael B. Monagan; Roman Pearce (PASCO, 2015)

Fermat benchmarks for rational expressionals in maple. - Michael B. Monagan; Roman Pearce (ACM Commun. Comput. Algebra, 2016)

An Algorithm For Spliting Polynomial Systems Based On F4. - Michael B. Monagan; Roman Pearce (PASCO@ISSAC, 2017)