| 2026 | CASC | Accelerating the Factorization of Multilinear Boolean Polynomials. | Tian Chen, Michael B. Monagan |
| 2025 | CASC | A Failure Probability Analysis of a Modular Algorithm to Compute the Monic GCD of Multivariate Polynomials over Algebraic Number Fields ${\mathbb {Q}(\alpha _1,\ldots ,\alpha _n)}$. | Mahsa Ansari, Michael B. Monagan |
| 2025 | CASC | A New Black Box GCD Algorithm Using Hensel Lifting. | Michael B. Monagan, Garrett Paluck |
| 2024 | CASC | A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. | Mahsa Ansari, Michael B. Monagan |
| 2024 | ISSAC | A New Sparse Polynomial GCD by Separating Terms. | Michael B. Monagan, Qiao-Long Huang |
| 2023 | CASC | Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. | Mahsa Ansari, Michael B. Monagan |
| 2023 | CASC | Solving Parametric Linear Systems Using Sparse Rational Function Interpolation. | Ayoola Jinadu, Michael B. Monagan |
| 2023 | ISSAC | A New Black Box Factorization Algorithm - the Non-monic Case. | Tian Chen, Michael B. Monagan |
| 2022 | CASC | An Interpolation Algorithm for Computing Dixon Resultants. | Ayoola Jinadu, Michael B. Monagan |
| 2022 | ISSAC | Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost. | Michael B. Monagan, Garrett Paluck |
| 2020 | CASC | The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization. | Tian Chen, Michael B. Monagan |
| 2019 | ISSAC | Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost. | Michael B. Monagan |
| 2018 | CASC | Factoring Multivariate Polynomials with Many Factors and Huge Coefficients. | Michael B. Monagan, Baris Tuncer |
| 2018 | ISSAC | An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. | Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang |
| 2017 | ISSAC | An Algorithm For Spliting Polynomial Systems Based On F4. | Michael B. Monagan, Roman Pearce |
| 2017 | ISSAC | Fast Parallel Multi-point Evaluation of Sparse Polynomials. | Michael B. Monagan, Alan Wong |
| 2017 | SYNASC | Resolving Zero Divisors Using Hensel Lifting. | John Kluesner, Michael B. Monagan |
| 2016 | CASC | Computing Characteristic Polynomials of Matrices of Structured Polynomials. | Marshall Law, Michael B. Monagan |
| 2016 | CASC | Using Sparse Interpolation in Hensel Lifting. | Michael B. Monagan, Baris Tuncer |
| 2016 | ISSAC | A Fast Parallel Sparse Polynomial GCD Algorithm. | Jiaxiong Hu, Michael B. Monagan |
| 2012 | CASC | Sparse Polynomial Powering Using Heaps. | Michael B. Monagan, Roman Pearce |
| 2009 | CASC | Lazy and Forgetful Polynomial Arithmetic and Applications. | Michael B. Monagan, Paul Vrbik |
| 2009 | ISSAC | On factorization of multivariate polynomials over algebraic number and function fields. | Seyed Mohammad Mahdi Javadi, Michael B. Monagan |
| 2009 | ISSAC | Parallel sparse polynomial multiplication using heaps. | Michael B. Monagan, Roman Pearce |
| 2007 | CASC | Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. | Michael B. Monagan, Roman Pearce |
| 2007 | ISSAC | A sparse modular GCD algorithm for polynomials over algebraic function fields. | Seyed Mohammad Mahdi Javadi, Michael B. Monagan |
| 2006 | AISC | Hierarchical Representations with Signatures for Large Expression Management. | Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan |
| 2006 | ISSAC | Fast rational function reconstruction. | Sara Khodadad, Michael B. Monagan |
| 2006 | ISSAC | Rational simplification modulo a polynomial ideal. | Michael B. Monagan, Roman Pearce |
| 2005 | ISSAC | Algorithms for the non-monic case of the sparse modular GCD algorithm. | Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf |
| 2005 | ISSAC | Probabilistic algorithms for computing resultants. | Michael B. Monagan |
| 2004 | ISSAC | Algorithms for polynomial GCD computation over algebraic function fields. | Mark van Hoeij, Michael B. Monagan |
| 2004 | ISSAC | Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. | Michael B. Monagan |
| 2002 | ISSAC | A modular GCD algorithm over number fields presented with multiple extensions. | Mark van Hoeij, Michael B. Monagan |
| 2001 | ISSAC | Algorithms for trigonometric polynomials. | Jamie Mulholland, Michael B. Monagan |
| 2000 | ISSAC | On the design and implementation of Brown's algorithm over the integers and number fields. | Michael B. Monagan, Allan D. Wittkopf |
| 1999 | ISSAC | On the Genericity of the Modular Polynomial GCD Algorithm. | Erich L. Kaltofen, Michael B. Monagan |
| 1999 | ISSAC | ADrien: An Implementation of Automatic Differentiation in Maple. | Dominique Villard, Michael B. Monagan |
| 1998 | SODA | Computing Univariate GCDs over Number Fields. | Michael B. Monagan, Roger Margot |
| 1997 | ISSAC | A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision. | Michael B. Monagan, Gladys Monagan |
| 1994 | ISSAC | Signature Functions for Algebraic Numbers. | Michael B. Monagan, Gaston H. Gonnet |
| 1993 | ISSAC | GRADIENT: Algorithmic Differentiation in Maple. | Michael B. Monagan, Walter M. Neuenschwander |