| 2007 |
|---|
| 25 | EE | Michael B. Monagan,
Roman Pearce:
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors.
CASC 2007: 295-315 |
| 24 | EE | Seyed Mohammad Mahdi Javadi,
Michael B. Monagan:
A sparse modular GCD algorithm for polynomials over algebraic function fields.
ISSAC 2007: 187-194 |
| 2006 |
|---|
| 23 | EE | Wenqin Zhou,
Jacques Carette,
David J. Jeffrey,
Michael B. Monagan:
Hierarchical Representations with Signatures for Large Expression Management.
AISC 2006: 254-268 |
| 22 | EE | Sara Khodadad,
Michael B. Monagan:
Fast rational function reconstruction.
ISSAC 2006: 184-190 |
| 21 | EE | Michael B. Monagan,
Roman Pearce:
Rational simplification modulo a polynomial ideal.
ISSAC 2006: 239-245 |
| 2005 |
|---|
| 20 | EE | 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 |
| 19 | EE | Michael B. Monagan:
Probabilistic algorithms for computing resultants.
ISSAC 2005: 245-252 |
| 2004 |
|---|
| 18 | EE | Michael B. Monagan:
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction.
ISSAC 2004: 243-249 |
| 17 | EE | Mark van Hoeij,
Michael B. Monagan:
Algorithms for polynomial GCD computation over algebraic function fields.
ISSAC 2004: 297-304 |
| 2002 |
|---|
| 16 | EE | Mark van Hoeij,
Michael B. Monagan:
A modular GCD algorithm over number fields presented with multiple extensions.
ISSAC 2002: 109-116 |
| 2001 |
|---|
| 15 | EE | Jamie Mulholland,
Michael B. Monagan:
Algorithms for trigonometric polynomials.
ISSAC 2001: 245-252 |
| 2000 |
|---|
| 14 | EE | 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 |
| 1999 |
|---|
| 13 | EE | Dominique Villard,
Michael B. Monagan:
ADrien: An Implementation of Automatic Differentiation in Maple.
ISSAC 1999: 221-228 |
| 12 | EE | Erich Kaltofen,
Michael B. Monagan:
On the Genericity of the Modular Polynomial GCD Algorithm.
ISSAC 1999: 59-66 |
| 1998 |
|---|
| 11 | | Michael B. Monagan,
Roger Margot:
Computing Univariate GCDs over Number Fields.
SODA 1998: 42-49 |
| 1997 |
|---|
| 10 | | Laurent Bernardin,
Michael B. Monagan:
Efficient Multivariate Factorization over Finite Fields.
AAECC 1997: 15-28 |
| 9 | | 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 |
| 8 | | 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): 427-443 (1997) |
| 7 | | Michael B. Monagan:
Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them?
J. Symb. Comput. 23(5/6): 535-549 (1997) |
| 1994 |
|---|
| 6 | EE | Michael B. Monagan,
Gaston H. Gonnet:
Signature Functions for Algebraic Numbers.
ISSAC 1994: 291-296 |
| 1993 |
|---|
| 5 | | Michael B. Monagan:
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions.
DISCO 1993: 81-94 |
| 4 | EE | Michael B. Monagan,
Walter M. Neuenschwander:
GRADIENT: Algorithmic Differentiation in Maple.
ISSAC 1993: 68-76 |
| 1992 |
|---|
| 3 | | Michael B. Monagan:
In-place Arithmetic for Polinominals over Zn.
DISCO 1992: 22-34 |
| 2 | | Michael B. Monagan:
A Heuristic Irreducibility Test for Univariate Polynomials.
J. Symb. Comput. 13(1): 47-58 (1992) |
| 1986 |
|---|
| 1 | | 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) |
