A Tutorial Introduction to Maple. - Bruce W. Char; Gregory J. Fee; Keith O. Geddes; Gaston H. Gonnet; Michael B. Monagan (J. Symb. Comput., 1986)

Maple V - library reference manual. - Bruce W. Char; Keith O. Geddes; Gaston H. Gonnet; Benton L. Leong; Michael B. Monagan (Springer, 1991)

Maple V - language reference manual. - Bruce W. Char; Keith O. Geddes; Gaston H. Gonnet; Benton L. Leong; Michael B. Monagan (Springer, 1991)

In-place Arithmetic for Polinominals over Zn. - Michael B. Monagan (DISCO, 1992)

A Heuristic Irreducibility Test for Univariate Polynomials. - Michael B. Monagan (J. Symb. Comput., 1992)

Gauss: A Parameterized Domain of Computation System with Support for Signature Functions. - Michael B. Monagan (DISCO, 1993)

GRADIENT: Algorithmic Differentiation in Maple. - Michael B. Monagan; Walter M. Neuenschwander (ISSAC, 1993)

von zur Gathen's factorization challenge. - Michael B. Monagan (SIGSAM Bull., 1993)

The Maple Computer Algebra System. - Michael B. Monagan (Comput. Sci. J. Moldova, 1993)

Signature Functions for Algebraic Numbers. - Michael B. Monagan; Gaston H. Gonnet (ISSAC, 1994)

Introduction to Gauss. - Dominik Gruntz; Michael B. Monagan (SIGSAM Bull., 1994)

Efficient Multivariate Factorization over Finite Fields. - Laurent Bernardin; Michael B. Monagan (AAECC, 1997)

A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision. - Michael B. Monagan; Gladys Monagan (ISSAC, 1997)

Problems, puzzles, challenges. - Gregory J. Fee; Michael B. Monagan (SIGSAM Bull., 1997)

Two Perturbation Calculations in Fluid Mechanics Using Large-Expression Management. - Robert M. Corless; David J. Jeffrey; Michael B. Monagan; Pratibha (J. Symb. Comput., 1997)

Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them? - Michael B. Monagan (J. Symb. Comput., 1997)

Computing Univariate GCDs over Number Fields. - Michael B. Monagan; Roger Margot (SODA, 1998)

On the Genericity of the Modular Polynomial GCD Algorithm. - Erich L. Kaltofen; Michael B. Monagan (ISSAC, 1999)

ADrien: An Implementation of Automatic Differentiation in Maple. - Dominique Villard; Michael B. Monagan (ISSAC, 1999)

On the design and implementation of Brown's algorithm over the integers and number fields. - Michael B. Monagan; Allan D. Wittkopf (ISSAC, 2000)

Algorithms for trigonometric polynomials. - Jamie Mulholland; Michael B. Monagan (ISSAC, 2001)

A modular GCD algorithm over number fields presented with multiple extensions. - Mark van Hoeij; Michael B. Monagan (ISSAC, 2002)

Algorithms for polynomial GCD computation over algebraic function fields. - Mark van Hoeij; Michael B. Monagan (ISSAC, 2004)

Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. - Michael B. Monagan (ISSAC, 2004)

Algorithms for the non-monic case of the sparse modular GCD algorithm. - Jennifer de Kleine; Michael B. Monagan; Allan D. Wittkopf (ISSAC, 2005)

Probabilistic algorithms for computing resultants. - Michael B. Monagan (ISSAC, 2005)

Hierarchical Representations with Signatures for Large Expression Management. - Wenqin Zhou; Jacques Carette; David J. Jeffrey; Michael B. Monagan (AISC, 2006)

Fast rational function reconstruction. - Sara Khodadad; Michael B. Monagan (ISSAC, 2006)

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 sparse modular GCD algorithm for polynomials over algebraic function fields. - Seyed Mohammad Mahdi Javadi; Michael B. Monagan (ISSAC, 2007)

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

Calculating really big cyclotomic polynomials (abstract only). - Andrew Arnold; Michael B. Monagan (ACM Commun. Comput. Algebra, 2008)

Lazy and Forgetful Polynomial Arithmetic and Applications. - Michael B. Monagan; Paul Vrbik (CASC, 2009)

On factorization of multivariate polynomials over algebraic number and function fields. - Seyed Mohammad Mahdi Javadi; Michael B. Monagan (ISSAC, 2009)

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

A high-performance algorithm for calculating cyclotomic polynomials. - Andrew Arnold; Michael B. Monagan (PASCO, 2010)

Parallel sparse polynomial interpolation over finite fields. - Seyed Mohammad Mahdi Javadi; Michael B. Monagan (PASCO, 2010)

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

A fast recursive algorithm for computing cyclotomic polynomials. - Andrew Arnold; Michael B. Monagan (ACM Commun. Comput. Algebra, 2010)

On sparse interpolation over finite fields. - Seyed Mohammad Mahdi Javadi; Michael B. Monagan (ACM Commun. Comput. Algebra, 2010)

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

Algorithms for solving linear systems over cyclotomic fields. - Liang Chen; Michael B. Monagan (J. Symb. Comput., 2010)

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

Calculating cyclotomic polynomials. - Andrew Arnold; Michael B. Monagan (Math. 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)

A new edge selection heuristic for computing the Tutte polynomial of an undirected graph - Michael B. Monagan (CoRR, 2012)

A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials. - Jiaxiong Hu; Michael B. Monagan (ACM Commun. Comput. Algebra, 2013)

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)

Optimizing and parallelizing the modular GCD algorithm. - Matthew Gibson; Michael B. Monagan (PASCO, 2015)

A parallel implementation for polynomial multiplication modulo a prime. - Marshall Law; Michael B. Monagan (PASCO, 2015)

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

Using sparse interpolation to solve multivariate diophantine equations. - Michael B. Monagan; Baris Tuncer (ACM Commun. Comput. Algebra, 2015)

Using Sparse Interpolation in Hensel Lifting. - Michael B. Monagan; Baris Tuncer (CASC, 2016)

Computing characteristic polynomials of matrices of structured polynomials. - Marshall Law; Michael B. Monagan (ACM Commun. Comput. Algebra, 2016)

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

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions. - Mark van Hoeij; Michael B. Monagan (CoRR, 2016)

Some results on counting roots of polynomials and the Sylvester resultant. - Michael B. Monagan; Baris Tuncer (CoRR, 2016)

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

Resolving Zero Divisors Using Hensel Lifting. - John Kluesner; Michael B. Monagan (SYNASC, 2017)

Fast parallel multi-point evaluation of sparse polynomials. - Michael B. Monagan; Alan Wong (ACM Commun. Comput. Algebra, 2017)

Factoring Multivariate Polynomials with Many Factors and Huge Coefficients. - Michael B. Monagan; Baris Tuncer (CASC, 2018)

Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation. - Michael B. Monagan; Baris Tuncer (ICMS, 2018)

An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. - Deepak Kapur; Dong Lu; Michael B. Monagan; Yao Sun 004; Dingkang Wang (ISSAC, 2018)

Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost. - Michael B. Monagan (ISSAC, 2019)

Using Leslie Matrices as the Application of Eigenvalues and Eigenvectors in a First Course in Linear Algebra. - Michael B. Monagan (MC, 2019)

Polynomial Factorization in Maple 2019. - Michael B. Monagan; Baris Tuncer (MC, 2019)

New bivariate Hensel lifting algorithm for n factors. - Garrett Paluck; Michael B. Monagan (ACM Commun. Comput. Algebra, 2019)

The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization. - Tian Chen; Michael B. Monagan (CASC, 2020)

Implementing the Tangent Graeffe Root Finding Method. - Joris van der Hoeven; Michael B. Monagan (ICMS, 2020)

Computing one billion roots using the tangent Graeffe method. - Joris van der Hoeven; Michael B. Monagan (ACM Commun. Comput. Algebra, 2020)

The 2019 Richard D. Jenks memorial prize. - Michael B. Monagan (ACM Commun. Comput. Algebra, 2020)

The complexity of sparse Hensel lifting and sparse polynomial factorization. - Michael B. Monagan; Baris Tuncer (J. Symb. Comput., 2020)

A call to build a publicly accessible library of lecture recordings in computer algebra. - Michael B. Monagan (ACM Commun. Comput. Algebra, 2021)

High-performance SIMD modular arithmetic for polynomial evaluation. - Pierre Fortin 001; Ambroise Fleury; François Lemaire; Michael B. Monagan (Concurr. Comput. Pract. Exp., 2021)

A fast parallel sparse polynomial GCD algorithm. - Jiaxiong Hu; Michael B. Monagan (J. Symb. Comput., 2021)

Algorithms for computing greatest common divisors of parametric multivariate polynomials. - Deepak Kapur; Dong Lu; Michael B. Monagan; Yao Sun 004; Dingkang Wang (J. Symb. Comput., 2021)

An Interpolation Algorithm for Computing Dixon Resultants. - Ayoola Jinadu; Michael B. Monagan (CASC, 2022)

Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost. - Michael B. Monagan; Garrett Paluck (ISSAC, 2022)

Factoring non-monic polynomials represented by black boxes. - Tian Chen; Michael B. Monagan (ACM Commun. Comput. Algebra, 2022)

A new interpolation algorithm for computing dixon resultants. - Ayoola Jinadu; Michael B. Monagan (ACM Commun. Comput. Algebra, 2022)

Speeding up polynomial GCD, a crucial operation in Maple. - Michael B. Monagan (Maple Trans., 2022)

Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation. - Tian Chen; Michael B. Monagan (Math. Comput. Sci., 2022)

Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. - Mahsa Ansari; Michael B. Monagan (CASC, 2023)

Solving Parametric Linear Systems Using Sparse Rational Function Interpolation. - Ayoola Jinadu; Michael B. Monagan (CASC, 2023)

A New Black Box Factorization Algorithm - the Non-monic Case. - Tian Chen; Michael B. Monagan (ISSAC, 2023)

How to program with formulas in Maple: Formulas in Maple. - Michael B. Monagan (Maple Trans., 2023)

A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. - Mahsa Ansari; Michael B. Monagan (CASC, 2024)

A New Sparse Polynomial GCD by Separating Terms. - Michael B. Monagan; Qiao-Long Huang (ISSAC, 2024)

A Maple Program to Factor Multivariate Polynomials Given by Black Boxes. - Tian Chen; Michael B. Monagan (ACM Commun. Comput. Algebra, 2024)

Implementing Kaltofen and Yagati's fast transposed Vandermonde solver. - Michael B. Monagan; Hyukho Kwon (Maple Trans., 2025)