| 2012 | ||
|---|---|---|
| c28 | ||
| i1 | Michael B. Monagan: A new edge selection heuristic for computing the Tutte polynomial of an undirected graph. CoRR abs/1209.5160 (2012) | |
| 2011 | ||
| j7 | Michael B. Monagan, Roman Pearce: Sparse polynomial division using a heap. J. Symb. Comput. 46(7): 807-822 (2011) | |
| j6 | Andrew Arnold, Michael B. Monagan: Calculating cyclotomic polynomials. Math. Comput. 80(276): 2359-2379 (2011) | |
| 2010 | ||
| j5 | 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 | |
| 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 | |
| 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 | ||
| 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 | ||
| 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 | ||
| 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 | |
| 1999 | ||
| c9 | Erich 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 | ||
| 1997 | ||
| j4 | 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) | |
| j3 | 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 | ||
| c4 | Michael B. Monagan, Gaston H. Gonnet: Signature Functions for Algebraic Numbers. ISSAC 1994: 291-296 | |
| 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 | ||
| 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 | |
| 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) | |
Colors in the list of coauthors
Last update Sun May 19 20:10:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page