The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
The calculation of multivariate polynomial resultants
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Computer Algebra: Past and Future
Journal of Symbolic Computation
The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime
IEEE Transactions on Computers
Computing with polynomials given by straight-line programs I: greatest common divisors
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Implementing Exact Calculations in Hardware
IEEE Transactions on Computers
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
A p-adic approach to the computation ofGröbner bases
Journal of Symbolic Computation
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Journal of Symbolic Computation
A new modular algorithm for computation of algebraic number polynomial gcds
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
The computation of polynomial greatest common divisors over an algebraic number field
Journal of Symbolic Computation
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Analysis of euclidean algorithms for polynomials over finite fields
Journal of Symbolic Computation
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Hankel matrices and computer algebra
ACM SIGSAM Bulletin - Issue #93
Power series remainder sequences and Padé fractions over an integral domain
Journal of Symbolic Computation
An analysis of the subresultant algorithm over an algebraic number field
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
On the multi-threaded computation of integral polynomial greatest common divisors
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Three new algorithms for multivariate polynomial GCD
Journal of Symbolic Computation
Computation of the Jordan canonical form of a square matrix (using the Axiom programming language)
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Efficient algorithms for Hankel matrices over Z[x1,…,xr]
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Evaluation of the heuristic polynomial GCD
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of subresultants
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A modular algorithm for computing greatest common right divisors of Ore polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Optimization strategies for the approximate GCD problem
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On the genericity of the modular polynomial GCD algorithm
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
On the design and implementation of Brown's algorithm over the integers and number fields
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
The Exact Solution of Linear Equations with Rational Function Coefficients
ACM Transactions on Mathematical Software (TOMS)
A Comparison of Algorithms for the Exact Solution of Linear Equations
ACM Transactions on Mathematical Software (TOMS)
Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
ACM Transactions on Mathematical Software (TOMS)
The Subresultant PRS Algorithm
ACM Transactions on Mathematical Software (TOMS)
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Theoretical Computer Science - Latin American theoretical informatics
Hensel lifting and bivariate polynomial factorisation over finite fields
Mathematics of Computation
A modular GCD algorithm over number fields presented with multiple extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Symbolic mathematical computation in a Ph.D. computer science program
SIGCSE '72 Proceedings of the second SIGCSE technical symposium on Education in computer science
Extended polynomial algorithms
ACM '73 Proceedings of the ACM annual conference
On the substitution of polynomial forms
ACM '73 Proceedings of the ACM annual conference
ACM '73 Proceedings of the ACM annual conference
On computing certain integrals, and implications for symbolic algebraic manipulation
ACM '72 Proceedings of the ACM annual conference - Volume 2
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Algebraic algorithms using p-adic constructions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
On the subresultant PRS algorithm
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Simplification of radical expressions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Completing nth powers of polynomials
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
The computational complexity of continued fractions
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Parallel algorithms for algebraic problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A modular greatest common divisor algorithm for gaussian polynomials
ACM '75 Proceedings of the 1975 annual conference
Double Sylvester sums for subresultants and multi-Schur functions
Journal of Symbolic Computation
Symbolic mathematical computation in a Ph. D. computer science program
ACM SIGCSE Bulletin
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The approximate GCD of inexact polynomials
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On algorithms for solving systems of polynomial equations
ACM SIGSAM Bulletin
Factoring multivariate polynomials over the integers
ACM SIGSAM Bulletin
On computing with factored rational expressions
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
A p-adic division with remainder algorithm
ACM SIGSAM Bulletin
Course outline: Yale University, New Haven
ACM SIGSAM Bulletin
A note on abnormal polynomial remainder sequences
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
Some comments on the modular approach to Gröbner-bases
ACM SIGSAM Bulletin
Symbolic mathematical computation: a survey
ACM SIGSAM Bulletin
An improved non-modular polynomial GCD algorithm
ACM SIGSAM Bulletin
Algebraic algorithm descriptions as programs
ACM SIGSAM Bulletin
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Output-sensitive modular algorithms for polynomial matrix normal forms
Journal of Symbolic Computation
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Computer Mathematics
Computing nearest Gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation
Finding exact minimal polynomial by approximations
Proceedings of the 2009 conference on Symbolic numeric computation
The ERES method for computing the approximate GCD of several polynomials
Applied Numerical Mathematics
Method for finding multiple roots of polynomials
Computers & Mathematics with Applications
The efficient calculation of powers of polynomials
Journal of Computer and System Sciences
Congruence arithmetic algorithms for polynomial real zero determination
Journal of Computer and System Sciences
Journal of Computer and System Sciences
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science
Editorial: Macsyma: A personal history
Journal of Symbolic Computation
Ways to implement computer algebra compactly
ACM Communications in Computer Algebra
Computer Aided Geometric Design
Spectrally degenerate graphs: Hereditary case
Journal of Combinatorial Theory Series B
Journal of Computational and Applied Mathematics
| Hi-index | 0.01 |