| Maple V library reference manual BW Char, KO Geddes, GH Gonnet, BL Leong, MB Monagan, S Watt Springer Science & Business Media, 2013 | 1597 | 2013 |
| First leaves: a tutorial introduction to Maple V BW Char, KO Geddes, GH Gonnet, BL Leong, MB Monagan, SM Watt Springer Science & Business Media, 2012 | 465 | 2012 |
| Maple 10 programming guide MB Monagan, KO Geddes, KM Heal, G Labahn, SM Vorkoetter, ... Maplesoft, Waterloo ON, Canada 6, 2005 | 342* | 2005 |
| Maple V Programming Guide: For Release 5 MB Monagan, KO Geddes, KM Heal, G Labahn, SM Vorkoetter, JS Devitt, ... Springer Science & Business Media, 2012 | 339 | 2012 |
| Maple introductory programming guide MB Monagan, KO Geddes, KM Heal, G Labahn, SM Vorkoetter, ... Maplesoft, 2005 | 173 | 2005 |
| A tutorial introduction to Maple BW Char, GJ Fee, KO Geddes, GH Gonnet, MB Monagan Journal of Symbolic Computation 2 (2), 179-200, 1986 | 130 | 1986 |
| Packing circles in a square: a review and new results R Peikert, D Würtz, M Monagan, C de Groot System Modelling and Optimization: Proceedings of the 15th IFIP Conference …, 1992 | 117 | 1992 |
| Parallel sparse polynomial multiplication using heaps M Monagan, R Pearce Proceedings of the 2009 international symposium on Symbolic and algebraic …, 2009 | 83 | 2009 |
| Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction M Monagan Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004 | 81 | 2004 |
| The first case of Fermat’s last theorem is true for all prime exponents up to 714,591,416,091,389 A Granville, MB Monagan Transactions of the American Mathematical Society 306 (1), 329-359, 1988 | 75 | 1988 |
| A modular GCD algorithm over number fields presented with multiple extensions M Van Hoeij, M Monagan Proceedings of the 2002 international symposium on Symbolic and algebraic …, 2002 | 56 | 2002 |
| Parallel sparse polynomial interpolation over finite fields SMM Javadi, M Monagan Proceedings of the 4th International Workshop on Parallel and Symbolic …, 2010 | 54 | 2010 |
| Sparse polynomial division using a heap M Monagan, R Pearce Journal of Symbolic Computation 46 (7), 807-822, 2011 | 53 | 2011 |
| Polynomial division using dynamic arrays, heaps, and packed exponent vectors M Monagan, R Pearce Computer Algebra in Scientific Computing: 10th International Workshop, CASC …, 2007 | 52 | 2007 |
| Language Reference Manual BW Char, KO Geddes, GH Gonnet, BL Leong, MB Monagan, SM Watt, ... Spring-en Verlag, 1991 | 48 | 1991 |
| Algorithms for the non-monic case of the sparse modular GCD algorithm J de Kleine, M Monagan, A Wittkopf Proceedings of the 2005 international symposium on Symbolic and algebraic …, 2005 | 46 | 2005 |
| Calculating cyclotomic polynomials A Arnold, M Monagan Mathematics of Computation 80 (276), 2359-2379, 2011 | 44 | 2011 |
| Introduction to GAUSS D Gruntz, M Monagan ACM SIGSAM Bulletin 28 (2), 3-19, 1994 | 38 | 1994 |
| Cryptography using Chebyshev polynomials GJ Fee, MB Monagan Maple Summer Workshop, Burnaby, Canada, 2004 | 37 | 2004 |
| A fast parallel sparse polynomial GCD algorithm J Hu, M Monagan Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016 | 35 | 2016 |
