Urmăriți
Michael Monagan
Michael Monagan
Professor of Mathematics, Simon Fraser University
Adresă de e-mail confirmată pe cecm.sfu.ca - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Maple V library reference manual
BW Char, KO Geddes, GH Gonnet, BL Leong, MB Monagan, S Watt
Springer Science & Business Media, 2013
15952013
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
4602012
Maple 10 programming guide
MB Monagan, KO Geddes, KM Heal, G Labahn, SM Vorkoetter, ...
Maplesoft, Waterloo ON, Canada 6, 2005
341*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
3402012
Maple introductory programming guide
MB Monagan, KO Geddes, KM Heal, G Labahn, SM Vorkoetter, ...
Maplesoft, 2005
1632005
A tutorial introduction to Maple
BW Char, GJ Fee, KO Geddes, GH Gonnet, MB Monagan
Journal of Symbolic Computation 2 (2), 179-200, 1986
1261986
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
1121992
Parallel sparse polynomial multiplication using heaps
M Monagan, R Pearce
Proceedings of the 2009 international symposium on Symbolic and algebraic …, 2009
782009
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
M Monagan
Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004
742004
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
711988
Language Reference Manual
BW Char, KO Geddes, GH Gonnet, BL Leong, MB Monagan, SM Watt, ...
Spring-en Verlag, 1991
671991
Sparse polynomial division using a heap
M Monagan, R Pearce
Journal of Symbolic Computation 46 (7), 807-822, 2011
522011
Parallel sparse polynomial interpolation over finite fields
SMM Javadi, M Monagan
Proceedings of the 4th International Workshop on Parallel and Symbolic …, 2010
522010
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
522002
Polynomial division using dynamic arrays, heaps, and packed exponent vectors
M Monagan, R Pearce
Computer Algebra in Scientific Computing: 10th International Workshop, CASC …, 2007
502007
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
422005
Calculating cyclotomic polynomials
A Arnold, M Monagan
Mathematics of Computation 80 (276), 2359-2379, 2011
402011
Introduction to GAUSS
D Gruntz, M Monagan
ACM SIGSAM Bulletin 28 (2), 3-19, 1994
371994
Cryptography using Chebyshev polynomials
GJ Fee, MB Monagan
Maple Summer Workshop, Burnaby, Canada, 2004
362004
Efficient multivariate factorization over finite fields
L Bernardin, MB Monagan
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 12th …, 1997
361997
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20