- CALCULATING CYCLOTOMIC POLYNOMIALS ANDREW ARNOLD AND MICHAEL MONAGAN
- Polynomial Division using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Parallel Sparse Polynomial Division Using Heaps Michael Monagan
- Algorithms for Polynomial GCD Computation over Algebraic Function Fields
- Probabilistic Algorithms for Computing Resultants Michael Monagan
- Rational Simplification Modulo a Polynomial Ideal Michael Monagan
- New Options to Visualize Systems of Differential Equations in Mohammad ali Ebrahimi and Michael Monagan
- A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision
- In-place Arithmetic for Univariate Polynomials over an Algebraic Number Field
- Sparse Polynomial Division Using a Heap Michael Monagan
- Parallel Sparse Polynomial Interpolation over Finite Fields Seyed Mohammad Mahdi Javadi
- Strongly Connected Graph Components and Computing Characteristic Polynomials of Integer Matrices in Maple
- Sparse Polynomial Multiplication and Division in Maple 14 Michael Monagan and Roman Pearce
- A high-performance algorithm for calculating cyclotomic polynomials.
- Algorithms for Solving Linear Systems over Cyclotomic Fields
- Lazy and Forgetful Polynomial Arithmetic and Applications Paul Vrbik
- Fast Rational Function Reconstruction Sara Khodadad
- Algorithms for the Non-monic Case of the Sparse Modular GCD Algorithm
- Algorithms for Trigonometric Polynomials Jamie Mulholland
- Efficient Multivariate Factorization Over Finite Laurent Bernardin 1 and Michael B. Monagan2
- Introduction to Gauss D. Gruntz and M. Monagan
- Gauss: a Parameterized Domain of Computation System with Support for
- Information Textbooks Media Resources www.JCE.DivCHED.org Vol. 84 No. 5 May 2007 Journal of Chemical Education 889
- On Factorization of Multivariate Polynomials over Algebraic Number and Function Fields
- A Sparse Modular GCD Algorithm for Polynomials over Algebraic Function Fields
- A Graph Theory Package for Maple, Part II: Graph Coloring, Graph Drawing, Support Tools,
- Parallel Sparse Polynomial Multiplication Using Heaps Michael Monagan
- Maximal Quotient Rational Reconstruction: An Almost Optimal Algorithm for Rational Reconstruction
- Parallel Sparse Polynomial Interpolation over Finite Fields
- In-place Arithmetic for Polynomials over Zn Michael Monagan
- A Modular GCD algorithm over Number Fields presented with Multiple Extensions.
- Parallel Sparse Polynomial Powering Using Heaps Michael Monagan
- FPSAC 2012, Nagoya, Japan DMTCS proc. (subm.), by the authors, 112 A new edge selection heuristic for computing
