Michael B. Monagan

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 45

Top Topics

Parallel Implementation

Computer Algebra

Multivariate Polynomials

Publicly Accessible

Top Venues

ACM Commun. Comput. Algebra

Publications

Mahsa Ansari, Michael B. Monagan
A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. CASC (2024)
Michael B. Monagan, Qiao-Long Huang
A New Sparse Polynomial GCD by Separating Terms. ISSAC (2024)
Tian Chen, Michael B. Monagan
A New Black Box Factorization Algorithm - the Non-monic Case. ISSAC (2023)
Mahsa Ansari, Michael B. Monagan
Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. CASC (2023)
Michael B. Monagan
How to program with formulas in Maple: Formulas in Maple. Maple Trans. 3 (1) (2023)
Ayoola Jinadu, Michael B. Monagan
Solving Parametric Linear Systems Using Sparse Rational Function Interpolation. CASC (2023)
Michael B. Monagan, Garrett Paluck
Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost. ISSAC (2022)
Ayoola Jinadu, Michael B. Monagan
An Interpolation Algorithm for Computing Dixon Resultants. CASC (2022)
Ayoola Jinadu, Michael B. Monagan
A new interpolation algorithm for computing dixon resultants. ACM Commun. Comput. Algebra 56 (2) (2022)
Tian Chen, Michael B. Monagan
Factoring non-monic polynomials represented by black boxes. ACM Commun. Comput. Algebra 56 (2) (2022)
Michael B. Monagan
Speeding up polynomial GCD, a crucial operation in Maple. Maple Trans. 2 (1) (2022)
Tian Chen, Michael B. Monagan
Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation. Math. Comput. Sci. 16 (2) (2022)
Pierre Fortin, Ambroise Fleury, François Lemaire, Michael B. Monagan
High-performance SIMD modular arithmetic for polynomial evaluation. Concurr. Comput. Pract. Exp. 33 (16) (2021)
Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang
Algorithms for computing greatest common divisors of parametric multivariate polynomials. J. Symb. Comput. 102 (2021)
Jiaxiong Hu, Michael B. Monagan
A fast parallel sparse polynomial GCD algorithm. J. Symb. Comput. 105 (2021)
Michael B. Monagan
A call to build a publicly accessible library of lecture recordings in computer algebra. ACM Commun. Comput. Algebra 55 (3) (2021)
Michael B. Monagan
The 2019 Richard D. Jenks memorial prize. ACM Commun. Comput. Algebra 54 (2) (2020)
Tian Chen, Michael B. Monagan
The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization. CASC (2020)
Joris van der Hoeven, Michael B. Monagan
Computing one billion roots using the tangent Graeffe method. ACM Commun. Comput. Algebra 54 (3) (2020)
Joris van der Hoeven, Michael B. Monagan
Implementing the Tangent Graeffe Root Finding Method. ICMS (2020)
Pierre Fortin, Ambroise Fleury, François Lemaire, Michael B. Monagan
High performance SIMD modular arithmetic for polynomial evaluation. CoRR (2020)
Michael B. Monagan, Baris Tuncer
The complexity of sparse Hensel lifting and sparse polynomial factorization. J. Symb. Comput. 99 (2020)
Michael B. Monagan, Baris Tuncer
Polynomial Factorization in Maple 2019. MC (2019)
Michael B. Monagan
Using Leslie Matrices as the Application of Eigenvalues and Eigenvectors in a First Course in Linear Algebra. MC (2019)
Michael B. Monagan
Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost. ISSAC (2019)
Garrett Paluck, Michael B. Monagan
factors. ACM Commun. Comput. Algebra 53 (3) (2019)
John Kluesner, Michael B. Monagan
Resolving zero-divisors using Hensel lifting. CoRR (2018)
Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. ISSAC (2018)
Michael B. Monagan, Baris Tuncer
Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation. ICMS (2018)
Michael B. Monagan, Baris Tuncer
Factoring Multivariate Polynomials with Many Factors and Huge Coefficients. CASC (2018)
Michael B. Monagan, Alan Wong
Fast Parallel Multi-point Evaluation of Sparse Polynomials. PASCO@ISSAC (2017)
Michael B. Monagan, Roman Pearce
An Algorithm For Spliting Polynomial Systems Based On F4. PASCO@ISSAC (2017)
John Kluesner, Michael B. Monagan
Resolving Zero Divisors Using Hensel Lifting. SYNASC (2017)
Michael B. Monagan, Alan Wong
Fast parallel multi-point evaluation of sparse polynomials. ACM Commun. Comput. Algebra 51 (1) (2017)
Jiaxiong Hu, Michael B. Monagan
A Fast Parallel Sparse Polynomial GCD Algorithm. ISSAC (2016)
Michael B. Monagan, Baris Tuncer
Using Sparse Interpolation in Hensel Lifting. CASC (2016)
Michael B. Monagan, Baris Tuncer
Some results on counting roots of polynomials and the Sylvester resultant. CoRR (2016)
Marshall Law, Michael B. Monagan
Computing characteristic polynomials of matrices of structured polynomials. ACM Commun. Comput. Algebra 50 (4) (2016)
Marshall Law, Michael B. Monagan
Computing Characteristic Polynomials of Matrices of Structured Polynomials. CASC (2016)
Mark van Hoeij, Michael B. Monagan
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions. CoRR (2016)
Michael B. Monagan, Roman Pearce
Fermat benchmarks for rational expressionals in maple. ACM Commun. Comput. Algebra 50 (4) (2016)
Michael B. Monagan, Roman Pearce
A compact parallel implementation of F4. PASCO (2015)
Matthew Gibson, Michael B. Monagan
Optimizing and parallelizing the modular GCD algorithm. PASCO (2015)
Marshall Law, Michael B. Monagan
A parallel implementation for polynomial multiplication modulo a prime. PASCO (2015)
Michael B. Monagan, Baris Tuncer
Using sparse interpolation to solve multivariate diophantine equations. ACM Commun. Comput. Algebra 49 (3) (2015)
Michael B. Monagan, Roman Pearce
The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects. ACM Commun. Comput. Algebra 48 (3/4) (2014)
Jiaxiong Hu, Michael B. Monagan
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Michael B. Monagan, Roman Pearce
Sparse Polynomial Powering Using Heaps. CASC (2012)
Michael B. Monagan, Roman Pearce
POLY: a new polynomial data structure for Maple 17. ACM Commun. Comput. Algebra 46 (3/4) (2012)
Michael B. Monagan, Roman Pearce
POLY: A New Polynomial Data Structure for Maple 17. ASCM (2012)
Michael B. Monagan
A new edge selection heuristic for computing the Tutte polynomial of an undirected graph CoRR (2012)
Michael B. Monagan, Roman Pearce
Sparse polynomial division using a heap. J. Symb. Comput. 46 (7) (2011)
Andrew Arnold, Michael B. Monagan
Calculating cyclotomic polynomials. Math. Comput. 80 (276) (2011)
Liang Chen, Michael B. Monagan
Algorithms for solving linear systems over cyclotomic fields. J. Symb. Comput. 45 (9) (2010)
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
On sparse interpolation over finite fields. ACM Commun. Comput. Algebra 44 (3/4) (2010)
Andrew Arnold, Michael B. Monagan
A high-performance algorithm for calculating cyclotomic polynomials. PASCO (2010)
Michael B. Monagan, Roman Pearce
Parallel sparse polynomial division using heaps. PASCO (2010)
Andrew Arnold, Michael B. Monagan
A fast recursive algorithm for computing cyclotomic polynomials. ACM Commun. Comput. Algebra 44 (3/4) (2010)
Michael B. Monagan, Roman Pearce
Sparse polynomial multiplication and division in Maple 14. ACM Commun. Comput. Algebra 44 (3/4) (2010)
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
Parallel sparse polynomial interpolation over finite fields. PASCO (2010)
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
On factorization of multivariate polynomials over algebraic number and function fields. ISSAC (2009)
Michael B. Monagan, Paul Vrbik
Lazy and Forgetful Polynomial Arithmetic and Applications. CASC (2009)
Michael B. Monagan, Roman Pearce
Parallel sparse polynomial multiplication using heaps. ISSAC (2009)
Andrew Arnold, Michael B. Monagan
Calculating really big cyclotomic polynomials (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)
Michael B. Monagan, Roman Pearce
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. CASC (2007)
Roman Pearce, Michael B. Monagan
A maple library for high performance sparse polynomial arithmetic. ACM Commun. Comput. Algebra 41 (3) (2007)
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
A sparse modular GCD algorithm for polynomials over algebraic function fields. ISSAC (2007)
Michael B. Monagan, Roman Pearce
Rational simplification modulo a polynomial ideal. ISSAC (2006)
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan
Hierarchical Representations with Signatures for Large Expression Management. AISC (2006)
Sara Khodadad, Michael B. Monagan
Fast rational function reconstruction. ISSAC (2006)
Michael B. Monagan
Probabilistic algorithms for computing resultants. ISSAC (2005)
Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf
Algorithms for the non-monic case of the sparse modular GCD algorithm. ISSAC (2005)
Mark van Hoeij, Michael B. Monagan
Algorithms for polynomial GCD computation over algebraic function fields. ISSAC (2004)
Michael B. Monagan
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. ISSAC (2004)
Mark van Hoeij, Michael B. Monagan
A modular GCD algorithm over number fields presented with multiple extensions. ISSAC (2002)
Jamie Mulholland, Michael B. Monagan
Algorithms for trigonometric polynomials. ISSAC (2001)
Michael B. Monagan, Allan D. Wittkopf
On the design and implementation of Brown's algorithm over the integers and number fields. ISSAC (2000)
Dominique Villard, Michael B. Monagan
ADrien: An Implementation of Automatic Differentiation in Maple. ISSAC (1999)
Erich Kaltofen, Michael B. Monagan
On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC (1999)
Michael B. Monagan, Roger Margot
Computing Univariate GCDs over Number Fields. SODA (1998)
Gregory J. Fee, Michael B. Monagan
Problems, puzzles, challenges. SIGSAM Bull. 31 (4) (1997)
Michael B. Monagan, Gladys Monagan
A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision. ISSAC (1997)
Laurent Bernardin, Michael B. Monagan
Efficient Multivariate Factorization over Finite Fields. AAECC (1997)
Michael B. Monagan
Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them? J. Symb. Comput. 23 (5/6) (1997)
Gregory J. Fee, Michael B. Monagan
Problems, puzzles, challenges. SIGSAM Bull. 31 (1) (1997)
Robert M. Corless, David J. Jeffrey, Michael B. Monagan, Pratibha
Two Perturbation Calculations in Fluid Mechanics Using Large-Expression Management. J. Symb. Comput. 23 (4) (1997)
Michael B. Monagan, Gaston H. Gonnet
Signature Functions for Algebraic Numbers. ISSAC (1994)
Dominik Gruntz, Michael B. Monagan
Introduction to Gauss. SIGSAM Bull. 28 (2) (1994)
Michael B. Monagan
The Maple Computer Algebra System. Comput. Sci. J. Moldova 1 (2) (1993)
Michael B. Monagan
von zur Gathen's factorization challenge. SIGSAM Bull. 27 (2) (1993)
Michael B. Monagan, Walter M. Neuenschwander
GRADIENT: Algorithmic Differentiation in Maple. ISSAC (1993)
Michael B. Monagan
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions. DISCO (1993)
Michael B. Monagan
. DISCO (1992)
Michael B. Monagan
A Heuristic Irreducibility Test for Univariate Polynomials. J. Symb. Comput. 13 (1) (1992)
Bruce W. Char, Gregory J. Fee, Keith O. Geddes, Gaston H. Gonnet, Michael B. Monagan
A Tutorial Introduction to Maple. J. Symb. Comput. 2 (2) (1986)