Michael B. Monagan

Orcid: 0000-0002-4652-2889

Affiliations:
  • Simon Fraser University


According to our database1, Michael B. Monagan authored at least 90 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A New Sparse Polynomial GCD by Separating Terms.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions.
Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

2023
How to program with formulas in Maple: Formulas in Maple.
Maple Trans., 2023

A New Black Box Factorization Algorithm - the Non-monic Case.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Solving Parametric Linear Systems Using Sparse Rational Function Interpolation.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022
Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation.
Math. Comput. Sci., 2022

Speeding up polynomial GCD, a crucial operation in Maple.
Maple Trans., 2022

A new interpolation algorithm for computing dixon resultants.
ACM Commun. Comput. Algebra, 2022

Factoring non-monic polynomials represented by black boxes.
ACM Commun. Comput. Algebra, 2022

Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

An Interpolation Algorithm for Computing Dixon Resultants.
Proceedings of the Computer Algebra in Scientific Computing - 24th International Workshop, 2022

2021
Algorithms for computing greatest common divisors of parametric multivariate polynomials.
J. Symb. Comput., 2021

A fast parallel sparse polynomial GCD algorithm.
J. Symb. Comput., 2021

High-performance SIMD modular arithmetic for polynomial evaluation.
Concurr. Comput. Pract. Exp., 2021

A call to build a publicly accessible library of lecture recordings in computer algebra.
ACM Commun. Comput. Algebra, 2021

2020
The complexity of sparse Hensel lifting and sparse polynomial factorization.
J. Symb. Comput., 2020

The 2019 Richard D. Jenks memorial prize.
ACM Commun. Comput. Algebra, 2020

Computing one billion roots using the tangent Graeffe method.
ACM Commun. Comput. Algebra, 2020

Implementing the Tangent Graeffe Root Finding Method.
Proceedings of the Mathematical Software - ICMS 2020, 2020

The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019
New bivariate Hensel lifting algorithm for <i>n</i> factors.
ACM Commun. Comput. Algebra, 2019

Polynomial Factorization in Maple 2019.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

Using Leslie Matrices as the Application of Eigenvalues and Eigenvectors in a First Course in Linear Algebra.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation.
Proceedings of the Mathematical Software - ICMS 2018, 2018

Factoring Multivariate Polynomials with Many Factors and Huge Coefficients.
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017
Fast parallel multi-point evaluation of sparse polynomials.
ACM Commun. Comput. Algebra, 2017

Resolving Zero Divisors Using Hensel Lifting.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

An Algorithm For Spliting Polynomial Systems Based On F4.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016
Some results on counting roots of polynomials and the Sylvester resultant.
CoRR, 2016

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions.
CoRR, 2016

Fermat benchmarks for rational expressionals in maple.
ACM Commun. Comput. Algebra, 2016

Computing characteristic polynomials of matrices of structured polynomials.
ACM Commun. Comput. Algebra, 2016

Using Sparse Interpolation in Hensel Lifting.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015
Using sparse interpolation to solve multivariate diophantine equations.
ACM Commun. Comput. Algebra, 2015

A compact parallel implementation of F4.
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

A parallel implementation for polynomial multiplication modulo a prime.
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

Optimizing and parallelizing the modular GCD algorithm.
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

2014
The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects.
ACM Commun. Comput. Algebra, 2014

2013
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials.
ACM Commun. Comput. Algebra, 2013

2012
A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
CoRR, 2012

POLY: a new polynomial data structure for Maple 17.
ACM Commun. Comput. Algebra, 2012

Sparse Polynomial Powering Using Heaps.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011
Calculating cyclotomic polynomials.
Math. Comput., 2011

Sparse polynomial division using a heap.
J. Symb. Comput., 2011

2010
Algorithms for solving linear systems over cyclotomic fields.
J. Symb. Comput., 2010

Sparse polynomial multiplication and division in Maple 14.
ACM Commun. Comput. Algebra, 2010

On sparse interpolation over finite fields.
ACM Commun. Comput. Algebra, 2010

A fast recursive algorithm for computing cyclotomic polynomials.
ACM Commun. Comput. Algebra, 2010

Parallel sparse polynomial division using heaps.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Parallel sparse polynomial interpolation over finite fields.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

A high-performance algorithm for calculating cyclotomic polynomials.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009
Parallel sparse polynomial multiplication using heaps.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

On factorization of multivariate polynomials over algebraic number and function fields.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Lazy and Forgetful Polynomial Arithmetic and Applications.
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008
Calculating really big cyclotomic polynomials (abstract only).
ACM Commun. Comput. Algebra, 2008

2007
A maple library for high performance sparse polynomial arithmetic.
ACM Commun. Comput. Algebra, 2007

A sparse modular GCD algorithm for polynomials over algebraic function fields.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006
Rational simplification modulo a polynomial ideal.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Fast rational function reconstruction.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Hierarchical Representations with Signatures for Large Expression Management.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

2005
Probabilistic algorithms for computing resultants.
Proceedings of the Symbolic and Algebraic Computation, 2005

Algorithms for the non-monic case of the sparse modular GCD algorithm.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction.
Proceedings of the Symbolic and Algebraic Computation, 2004

Algorithms for polynomial GCD computation over algebraic function fields.
Proceedings of the Symbolic and Algebraic Computation, 2004

2002
A modular GCD algorithm over number fields presented with multiple extensions.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Algorithms for trigonometric polynomials.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
On the design and implementation of Brown's algorithm over the integers and number fields.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
ADrien: An Implementation of Automatic Differentiation in Maple.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

On the Genericity of the Modular Polynomial GCD Algorithm.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998
Computing Univariate GCDs over Number Fields.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them?
J. Symb. Comput., 1997

Two Perturbation Calculations in Fluid Mechanics Using Large-Expression Management.
J. Symb. Comput., 1997

Problems, puzzles, challenges.
SIGSAM Bull., 1997

A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Efficient Multivariate Factorization over Finite Fields.
Proceedings of the Applied Algebra, 1997

1994
Introduction to Gauss.
SIGSAM Bull., 1994

Signature Functions for Algebraic Numbers.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993
The Maple Computer Algebra System.
Comput. Sci. J. Moldova, 1993

von zur Gathen's factorization challenge.
SIGSAM Bull., 1993

GRADIENT: Algorithmic Differentiation in Maple.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Gauss: A Parameterized Domain of Computation System with Support for Signature Functions.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992
A Heuristic Irreducibility Test for Univariate Polynomials.
J. Symb. Comput., 1992

In-place Arithmetic for Polinominals over Z<i><sub>n</sub></i>.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1992

1991
Maple V - language reference manual.
Springer, ISBN: 978-0-387-97622-8, 1991

Maple V - library reference manual.
Springer, ISBN: 978-0-387-97592-4, 1991

1986
A Tutorial Introduction to Maple.
J. Symb. Comput., 1986


  Loading...