default search action
Michael B. Monagan
Person information
- affiliation: Simon Fraser University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c53]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: 27-46 - [c52]Michael B. Monagan
, Qiao-Long Huang
A New Sparse Polynomial GCD by Separating Terms. ISSAC 2024: 134-142 - 2023
- [j37]Michael B. Monagan
How to program with formulas in Maple: Formulas in Maple. Maple Trans. 3(1) (2023) - [c51]Mahsa Ansari, Michael B. Monagan:
Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions. CASC 2023: 1-20 - [c50]Ayoola Jinadu, Michael B. Monagan:
Solving Parametric Linear Systems Using Sparse Rational Function Interpolation. CASC 2023: 233-254 - [c49]Tian Chen
A New Black Box Factorization Algorithm - the Non-monic Case. ISSAC 2023: 173-181 - 2022
- [j36]Tian Chen, Michael B. Monagan:
Factoring non-monic polynomials represented by black boxes. ACM Commun. Comput. Algebra 56(2): 80-83 (2022) - [j35]Ayoola Jinadu, Michael B. Monagan:
A new interpolation algorithm for computing dixon resultants. ACM Commun. Comput. Algebra 56(2): 88-91 (2022) - [j34]Michael B. Monagan
Speeding up polynomial GCD, a crucial operation in Maple. Maple Trans. 2(1) (2022) - [j33]Tian Chen, Michael B. Monagan:
Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation. Math. Comput. Sci. 16(2-3): 18 (2022) - [c48]Ayoola Jinadu, Michael B. Monagan:
An Interpolation Algorithm for Computing Dixon Resultants. CASC 2022: 185-205 - [c47]Michael B. Monagan, Garrett Paluck:
Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost. ISSAC 2022: 159-166 - 2021
- [j32]Michael B. Monagan:
A call to build a publicly accessible library of lecture recordings in computer algebra. ACM Commun. Comput. Algebra 55(3): 65-67 (2021) - [j31]Pierre Fortin
High-performance SIMD modular arithmetic for polynomial evaluation. Concurr. Comput. Pract. Exp. 33(16) (2021) - [j30]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: 3-20 (2021) - [j29]Jiaxiong Hu, Michael B. Monagan:
A fast parallel sparse polynomial GCD algorithm. J. Symb. Comput. 105: 28-63 (2021) - 2020
- [j28]Michael B. Monagan:
The 2019 Richard D. Jenks memorial prize. ACM Commun. Comput. Algebra 54(2): 61 (2020) - [j27]Joris van der Hoeven
Computing one billion roots using the tangent Graeffe method. ACM Commun. Comput. Algebra 54(3): 65-85 (2020) - [j26]Michael B. Monagan, Baris Tuncer:
The complexity of sparse Hensel lifting and sparse polynomial factorization. J. Symb. Comput. 99: 189-230 (2020) - [c46]Tian Chen, Michael B. Monagan:
The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization. CASC 2020: 150-169 - [c45]Joris van der Hoeven
Implementing the Tangent Graeffe Root Finding Method. ICMS 2020: 482-492 - [i5]Pierre Fortin, Ambroise Fleury, François Lemaire
High performance SIMD modular arithmetic for polynomial evaluation. CoRR abs/2004.11571 (2020)
2010 – 2019
- 2019
- [j25]Garrett Paluck, Michael B. Monagan:
New bivariate Hensel lifting algorithm for n factors. ACM Commun. Comput. Algebra 53(3): 142-145 (2019) - [c44]Michael B. Monagan:
Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost. ISSAC 2019: 299-306 - [c43]Michael B. Monagan:
Using Leslie Matrices as the Application of Eigenvalues and Eigenvectors in a First Course in Linear Algebra. MC 2019: 279-291 - [c42]Michael B. Monagan, Baris Tuncer:
Polynomial Factorization in Maple 2019. MC 2019: 341-345 - 2018
- [c41]Michael B. Monagan, Baris Tuncer:
Factoring Multivariate Polynomials with Many Factors and Huge Coefficients. CASC 2018: 319-334 - [c40]Michael B. Monagan, Baris Tuncer:
Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation. ICMS 2018: 359-368 - [c39]Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. ISSAC 2018: 239-246 - [i4]John Kluesner, Michael B. Monagan:
Resolving zero-divisors using Hensel lifting. CoRR abs/1801.03161 (2018) - 2017
- [j24]Michael B. Monagan, Alan Wong:
Fast parallel multi-point evaluation of sparse polynomials. ACM Commun. Comput. Algebra 51(1): 12-14 (2017) - [c38]Michael B. Monagan, Alan Wong:
Fast Parallel Multi-point Evaluation of Sparse Polynomials. PASCO@ISSAC 2017: 4:1-4:7 - [c37]Michael B. Monagan, Roman Pearce:
An Algorithm For Spliting Polynomial Systems Based On F4. PASCO@ISSAC 2017: 12:1-12:5 - [c36]John Kluesner, Michael B. Monagan:
Resolving Zero Divisors Using Hensel Lifting. SYNASC 2017: 39-48 - [e1]Jean-Charles Faugère, Michael B. Monagan, Hans-Wolfgang Loidl:
Proceedings of the International Workshop on Parallel Symbolic Computation, PASCO@ISSAC 2017, Kaiserslautern, Germany, July 23-24, 2017. ACM 2017, ISBN 978-1-4503-5288-8 [contents] - 2016
- [j23]Marshall Law, Michael B. Monagan:
Computing characteristic polynomials of matrices of structured polynomials. ACM Commun. Comput. Algebra 50(4): 182-184 (2016) - [j22]Michael B. Monagan, Roman Pearce:
Fermat benchmarks for rational expressionals in maple. ACM Commun. Comput. Algebra 50(4): 188-190 (2016) - [c35]Marshall Law, Michael B. Monagan:
Computing Characteristic Polynomials of Matrices of Structured Polynomials. CASC 2016: 336-348 - [c34]Michael B. Monagan, Baris Tuncer:
Using Sparse Interpolation in Hensel Lifting. CASC 2016: 381-400 - [c33]Jiaxiong Hu, Michael B. Monagan:
A Fast Parallel Sparse Polynomial GCD Algorithm. ISSAC 2016: 271-278 - [i3]Mark van Hoeij, Michael B. Monagan:
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions. CoRR abs/1601.01038 (2016) - [i2]Michael B. Monagan, Baris Tuncer:
Some results on counting roots of polynomials and the Sylvester resultant. CoRR abs/1609.08712 (2016) - 2015
- [j21]Michael B. Monagan, Baris Tuncer:
Using sparse interpolation to solve multivariate diophantine equations. ACM Commun. Comput. Algebra 49(3): 94-97 (2015) - [c32]Matthew Gibson, Michael B. Monagan:
Optimizing and parallelizing the modular GCD algorithm. PASCO 2015: 44-52 - [c31]Marshall Law, Michael B. Monagan:
A parallel implementation for polynomial multiplication modulo a prime. PASCO 2015: 78-86 - [c30]Michael B. Monagan, Roman Pearce:
A compact parallel implementation of F4. PASCO 2015: 95-100 - 2014
- [j20]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): 166-186 (2014) - 2013
- [j19]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): 108-109 (2013) - 2012
- [j18]Michael B. Monagan, Roman Pearce:
POLY: a new polynomial data structure for Maple 17. ACM Commun. Comput. Algebra 46(3/4): 164-167 (2012) - [c29]Michael B. Monagan, Roman Pearce:
POLY: A New Polynomial Data Structure for Maple 17. ASCM 2012: 325-348 - [c28]Michael B. Monagan, Roman Pearce:
Sparse Polynomial Powering Using Heaps. CASC 2012: 236-247 - [i1]Michael B. Monagan:
A new edge selection heuristic for computing the Tutte polynomial of an undirected graph. CoRR abs/1209.5160 (2012) - 2011
- [j17]Michael B. Monagan, Roman Pearce:
Sparse polynomial division using a heap. J. Symb. Comput. 46(7): 807-822 (2011) - [j16]Andrew Arnold, Michael B. Monagan:
Calculating cyclotomic polynomials. Math. Comput. 80(276): 2359-2379 (2011) - 2010
- [j15]Andrew Arnold, Michael B. Monagan:
A fast recursive algorithm for computing cyclotomic polynomials. ACM Commun. Comput. Algebra 44(3/4): 89-90 (2010) - [j14]Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
On sparse interpolation over finite fields. ACM Commun. Comput. Algebra 44(3/4): 116-117 (2010) - [j13]Michael B. Monagan, Roman Pearce:
Sparse polynomial multiplication and division in Maple 14. ACM Commun. Comput. Algebra 44(3/4): 205-209 (2010) - [j12]Liang Chen, Michael B. Monagan:
Algorithms for solving linear systems over cyclotomic fields. J. Symb. Comput. 45(9): 902-917 (2010) - [c27]Michael B. Monagan, Roman Pearce:
Parallel sparse polynomial division using heaps. PASCO 2010: 105-111 - [c26]Andrew Arnold, Michael B. Monagan:
A high-performance algorithm for calculating cyclotomic polynomials. PASCO 2010: 112-120 - [c25]Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
Parallel sparse polynomial interpolation over finite fields. PASCO 2010: 160-168
2000 – 2009
- 2009
- [c24]Michael B. Monagan, Paul Vrbik:
Lazy and Forgetful Polynomial Arithmetic and Applications. CASC 2009: 226-239 - [c23]Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
On factorization of multivariate polynomials over algebraic number and function fields. ISSAC 2009: 199-206 - [c22]Michael B. Monagan, Roman Pearce:
Parallel sparse polynomial multiplication using heaps. ISSAC 2009: 263-270 - 2008
- [j11]Andrew Arnold, Michael B. Monagan:
Calculating really big cyclotomic polynomials (abstract only). ACM Commun. Comput. Algebra 42(1-2): 48-49 (2008) - 2007
- [j10]Roman Pearce, Michael B. Monagan:
A maple library for high performance sparse polynomial arithmetic. ACM Commun. Comput. Algebra 41(3): 110-111 (2007) - [c21]Michael B. Monagan, Roman Pearce:
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. CASC 2007: 295-315 - [c20]Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
A sparse modular GCD algorithm for polynomials over algebraic function fields. ISSAC 2007: 187-194 - 2006
- [c19]Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan:
Hierarchical Representations with Signatures for Large Expression Management. AISC 2006: 254-268 - [c18]Sara Khodadad, Michael B. Monagan:
Fast rational function reconstruction. ISSAC 2006: 184-190 - [c17]Michael B. Monagan, Roman Pearce:
Rational simplification modulo a polynomial ideal. ISSAC 2006: 239-245 - 2005
- [c16]Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf:
Algorithms for the non-monic case of the sparse modular GCD algorithm. ISSAC 2005: 124-131 - [c15]Michael B. Monagan:
Probabilistic algorithms for computing resultants. ISSAC 2005: 245-252 - 2004
- [c14]Michael B. Monagan:
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. ISSAC 2004: 243-249 - [c13]Mark van Hoeij, Michael B. Monagan:
Algorithms for polynomial GCD computation over algebraic function fields. ISSAC 2004: 297-304 - 2002
- [c12]Mark van Hoeij, Michael B. Monagan:
A modular GCD algorithm over number fields presented with multiple extensions. ISSAC 2002: 109-116 - 2001
- [c11]Jamie Mulholland, Michael B. Monagan:
Algorithms for trigonometric polynomials. ISSAC 2001: 245-252 - 2000
- [c10]Michael B. Monagan, Allan D. Wittkopf:
On the design and implementation of Brown's algorithm over the integers and number fields. ISSAC 2000: 225-233
1990 – 1999
- 1999
- [c9]Erich L. Kaltofen, Michael B. Monagan:
On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC 1999: 59-66 - [c8]Dominique Villard, Michael B. Monagan:
ADrien: An Implementation of Automatic Differentiation in Maple. ISSAC 1999: 221-228 - 1998
- [c7]Michael B. Monagan, Roger Margot:
Computing Univariate GCDs over Number Fields. SODA 1998: 42-49 - 1997
- [j9]Gregory J. Fee, Michael B. Monagan:
Problems, puzzles, challenges. SIGSAM Bull. 31(1): 22-23 (1997) - [j8]Gregory J. Fee, Michael B. Monagan:
Problems, puzzles, challenges. SIGSAM Bull. 31(4): 48-49 (1997) - [j7]Robert M. Corless
Two Perturbation Calculations in Fluid Mechanics Using Large-Expression Management. J. Symb. Comput. 23(4): 427-443 (1997) - [j6]Michael B. Monagan:
Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them? J. Symb. Comput. 23(5/6): 535-549 (1997) - [c6]Laurent Bernardin, Michael B. Monagan:
Efficient Multivariate Factorization over Finite Fields. AAECC 1997: 15-28 - [c5]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: 257-264 - 1994
- [j5]Dominik Gruntz, Michael B. Monagan:
Introduction to Gauss. SIGSAM Bull. 28(2): 3-19 (1994) - [c4]Michael B. Monagan, Gaston H. Gonnet:
Signature Functions for Algebraic Numbers. ISSAC 1994: 291-296 - 1993
- [j4]Michael B. Monagan:
von zur Gathen's factorization challenge. SIGSAM Bull. 27(2): 13-18 (1993) - [j3]Michael B. Monagan:
The Maple Computer Algebra System. Comput. Sci. J. Moldova 1(2): 49-63 (1993) - [c3]Michael B. Monagan:
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions. DISCO 1993: 81-94 - [c2]Michael B. Monagan, Walter M. Neuenschwander:
GRADIENT: Algorithmic Differentiation in Maple. ISSAC 1993: 68-76 - 1992
- [j2]Michael B. Monagan:
A Heuristic Irreducibility Test for Univariate Polynomials. J. Symb. Comput. 13(1): 47-58 (1992) - [c1]Michael B. Monagan:
In-place Arithmetic for Polinominals over Zn. DISCO 1992: 22-34 - 1991
- [b2]Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, Benton L. Leong, Michael B. Monagan:
Maple V - language reference manual. Springer 1991, ISBN 978-0-387-97622-8, pp. I-XV, 1-267 - [b1]Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, Benton L. Leong, Michael B. Monagan:
Maple V - library reference manual. Springer 1991, ISBN 978-0-387-97592-4, pp. I-XXV, 1-698
1980 – 1989
- 1986
- [j1]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): 179-200 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: