Michael B. Monagan

发表

A high-performance algorithm for calculating cyclotomic polynomials

Andrew Arnold, Michael B. Monagan, 2010, PASCO.

Calculating cyclotomic polynomials

Andrew Arnold, Michael B. Monagan, M. Monagan, 2011, Math. Comput..

On sparse interpolation over finite fields

Michael B. Monagan, Seyed Mohammad Mahdi Javadi, 2011, ACCA.

Rational simplification modulo a polynomial ideal

Michael B. Monagan, Roman Pearce, 2006, ISSAC '06.

Two Perturbation Calculations in Fluid Mechanics Using Large-Expression Management

Robert M. Corless, David J. Jeffrey, Pratibha, 1997, J. Symb. Comput..

Using Leslie Matrices as the Application of Eigenvalues and Eigenvectors in a First Course in Linear Algebra

Michael B. Monagan, 2019, MC.

von zur Gathen's factorization challenge

Michael B. Monagan, 1993, SIGS.

Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction

Michael B. Monagan, M. Monagan, 2004, ISSAC '04.

An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD

Yao Sun, Deepak Kapur, Dong Lu, 2018, ISSAC.

Efficient Multivariate Factorization over Finite Fields

Michael B. Monagan, Laurent Bernardin, M. Monagan, 1997, AAECC.

A maple library for high performance sparse polynomial arithmetic

Michael B. Monagan, Roman Pearce, 2007, ACCA.

Sparse polynomial multiplication and division in Maple 14

Michael B. Monagan, Roman Pearce, 2011, ACCA.

ADrien: an implementation of automatic differentiation in Maple

Michael B. Monagan, Dominique Villard, 1999, ISSAC '99.

A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials

Michael B. Monagan, Jiaxiong Hu, 2014, ACCA.

The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects

Michael B. Monagan, Roman Pearce, M. Monagan, 2015, ACCA.

Parallel sparse polynomial multiplication using heaps

Michael B. Monagan, Roman Pearce, M. Monagan, 2009, ISSAC '09.

A fast recursive algorithm for computing cyclotomic polynomials

Andrew Arnold, Michael B. Monagan, 2011, ACCA.

POLY: a new polynomial data structure for Maple 17

Michael B. Monagan, Roman Pearce, M. Monagan, 2013, ACCA.

Computing characteristic polynomials of matrices of structured polynomials

Michael B. Monagan, Marshall Law, 2017, ACCA.

Maple V Library Reference Manual

Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, 1992, Springer New York.

Algorithms for the non-monic case of the sparse modular GCD algorithm

Michael B. Monagan, Allan D. Wittkopf, Jennifer de Kleine, 2005, ISSAC.

Worksheets and Notebooks: Can We Teach Mathematical Algorithms with Them?

Michael B. Monagan, 1997, J. Symb. Comput..

Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors

Michael B. Monagan, Roman Pearce, M. Monagan, 2007, CASC.

Fast parallel multi-point evaluation of sparse polynomials

Michael B. Monagan, Alan Wong, 2017, ACCA.

Gauss: A Parameterized Domain of Computation System with Support for Signature Functions

Michael B. Monagan, 1993, DISCO.

GRADIENT: algorithmic differentiation in Maple

Michael B. Monagan, Walter M. Neuenschwander, M. Monagan, 1993, ISSAC '93.

POLY: A New Polynomial Data Structure for Maple 17

Michael B. Monagan, Roman Pearce, 2012, ASCM.

A Heuristic Irreducibility Test for Univariate Polynomials

Michael B. Monagan, M. Monagan, 1992, J. Symb. Comput..

Fast rational function reconstruction

Michael B. Monagan, Sara Khodadad, 2006, ISSAC '06.

A modular GCD algorithm over number fields presented with multiple extensions

Mark van Hoeij, Michael B. Monagan, 2002, ISSAC '02.

Problems, puzzles, challenges

Michael B. Monagan, Gregory J. Fee, 1997, SIGSAM Bull..

A new edge selection heuristic for computing the Tutte polynomial of an undirected graph pdf

Michael B. Monagan, M. Monagan, 2012, ArXiv.

On the genericity of the modular polynomial GCD algorithm

Erich Kaltofen, Michael B. Monagan, 1999, ISSAC '99.

A sparse modular GCD algorithm for polynomials over algebraic function fields

Michael B. Monagan, Seyed Mohammad Mahdi Javadi, 2007, ISSAC '07.

A compact parallel implementation of F4

Michael B. Monagan, Roman Pearce, M. Monagan, 2015, PASCO.

Maple V Language Reference Manual

Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, 1993, Springer US.

The Maple Computer Algebra System

Michael B. Monagan, 1993, Comput. Sci. J. Moldova.

Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation

Michael B. Monagan, Baris Tuncer, 2018, ICMS.

A parallel implementation for polynomial multiplication modulo a prime

Michael B. Monagan, Marshall Law, M. Monagan, 2015, PASCO.

A Fast Parallel Sparse Polynomial GCD Algorithm

Michael B. Monagan, Jiaxiong Hu, M. Monagan, 2016, ISSAC.

Using sparse interpolation to solve multivariate diophantine equations

Michael B. Monagan, Baris Tuncer, 2015, ACCA.

Using Sparse Interpolation in Hensel Lifting

Michael B. Monagan, Baris Tuncer, 2016, CASC.

Algorithms for polynomial GCD computation over algebraic function fields

Mark van Hoeij, Michael B. Monagan, M. Monagan, 2004, ISSAC '04.

Computing Characteristic Polynomials of Matrices of Structured Polynomials

Michael B. Monagan, Marshall Law, 2016, CASC.

Fermat benchmarks for rational expressionals in maple

Michael B. Monagan, Roman Pearce, 2017, ACCA.

Parallel sparse polynomial division using heaps

Michael B. Monagan, Roman Pearce, 2010, PASCO.

Introduction to Gauss

Michael B. Monagan, Dominik Gruntz, 1994, SIGS.

The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization

Tian Chen, Michael B. Monagan, 2020, CASC.

An Algorithm For Spliting Polynomial Systems Based On F4

Michael B. Monagan, Roman Pearce, M. Monagan, 2017, PASCO@ISSAC.

Lazy and Forgetful Polynomial Arithmetic and Applications

Michael B. Monagan, Paul Vrbik, 2009, CASC.

Sparse polynomial division using a heap

Michael B. Monagan, Roman Pearce, 2011, J. Symb. Comput..

Resolving Zero Divisors Using Hensel Lifting

Michael B. Monagan, John Kluesner, M. Monagan, 2017, 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

Problems, puzzles, challenges

Michael B. Monagan, Gregory J. Fee, 1997, SIGS.

Optimizing and parallelizing the modular GCD algorithm

Michael B. Monagan, Matthew Gibson, M. Monagan, 2015, PASCO.

Factoring Multivariate Polynomials with Many Factors and Huge Coefficients

Michael B. Monagan, Baris Tuncer, 2018, CASC.

Signature functions for algebraic numbers

Gaston H. Gonnet, Michael B. Monagan, G. Gonnet, 1994, ISSAC '94.

A toolbox for program manipulation and efficient code generation with an application to a problem in computer vision

Michael B. Monagan, Gladys Monagan, 1997, ISSAC.

Computing univariate GCDs over number fields

Michael B. Monagan, Roger Margot, 1998, SODA '98.

Calculating really big cyclotomic polynomials (abstract only)

Andrew Arnold, Michael B. Monagan, 2008, ACCA.

Sparse Polynomial Powering Using Heaps

Michael B. Monagan, Roman Pearce, M. Monagan, 2012, CASC.

Parallel sparse polynomial interpolation over finite fields

Michael B. Monagan, Seyed Mohammad Mahdi Javadi, M. Monagan, 2010, PASCO.

Hierarchical Representations with Signatures for Large Expression Management

Jacques Carette, David J. Jeffrey, Michael B. Monagan, 2006, AISC.

Algorithms for solving linear systems over cyclotomic fields

Liang Chen, Michael B. Monagan, M. Monagan, 2010, J. Symb. Comput..

On factorization of multivariate polynomials over algebraic number and function fields

Michael B. Monagan, Seyed Mohammad Mahdi Javadi, 2009, ISSAC '09.

Fast Parallel Multi-point Evaluation of Sparse Polynomials

Michael B. Monagan, Alan Wong, M. Monagan, 2017, PASCO@ISSAC.

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions pdf

Mark van Hoeij, Michael B. Monagan, M. Monagan, 2016, ArXiv.

In-place Arithmetic for Polinominals over Zn

Michael B. Monagan, 1992, DISCO.

Some results on counting roots of polynomials and the Sylvester resultant pdf

Michael B. Monagan, Baris Tuncer, 2016, ArXiv.

Algorithms for trigonometric polynomials

Michael B. Monagan, Jamie Mulholland, 2001, ISSAC '01.

Probabilistic algorithms for computing resultants

Michael B. Monagan, M. Monagan, 2005, ISSAC.

Implementing the Tangent Graeffe Root Finding Method

Joris van der Hoeven, Michael B. Monagan, M. Monagan, 2020, ICMS.

On the design and implementation of Brown's algorithm over the integers and number fields

Michael B. Monagan, Allan D. Wittkopf, 2000, ISSAC.

The PolynomialIdeals Maple package

Roger A. Pearce, Michael B. Monagan, 2004 .

ON THE DESIGN AND PERFORMANCE OF THE MAPLE SYSTEM *

Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, 2005 .