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 computation of polynomial greatest common divisors
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The calculation of multivariate polynomial resultants
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algorithms for exact polynomial root calculation
Algorithms for exact polynomial root calculation
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
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Implementing Exact Calculations in Hardware
IEEE Transactions on Computers
An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Solving systems of nonlinear polynomial equations faster
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
Singular points of algebraic curves
Journal of Symbolic Computation
Analysis of euclidean algorithms for polynomials over finite fields
Journal of Symbolic Computation
On the Euclidean scheme for polynomials having interlaced real zeros
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
Power series remainder sequences and Padé fractions over an integral domain
Journal of Symbolic Computation
Three new algorithms for multivariate polynomial GCD
Journal of Symbolic 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
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximate polynomial greatest common divisors and nearest singular polynomials
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
On rank properties of Toeplitz matrices over finite fields
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Fraction-free computation of matrix Padé systems
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
GCD of polynomials and Bezout matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A subresultant theory for Ore polynomials with applications
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Accurate computation of the medial axis of a polyhedron
Proceedings of the fifth ACM symposium on Solid modeling and applications
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
The Subresultant PRS Algorithm
ACM Transactions on Mathematical Software (TOMS)
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Theoretical Computer Science - Latin American theoretical informatics
An elementary approach to subresultants theory
Journal of Symbolic Computation
Fraction-free row reduction of matrices of skew polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Symbolic mathematical computation in a Ph.D. computer science program
SIGCSE '72 Proceedings of the second SIGCSE technical symposium on Education in computer science
ACM '73 Proceedings of the ACM annual conference
On the subresultant PRS algorithm
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
The complexity of elementary algebra and geometry
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for algebraic problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Double Sylvester sums for subresultants and multi-Schur functions
Journal of Symbolic Computation
The subresultant and clusters of close roots
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Symbolic mathematical computation in a Ph. D. computer science program
ACM SIGCSE Bulletin
Exact computation of the medial axis of a polyhedron
Computer Aided Geometric Design
Theoretical Computer Science - Algebraic and numerical algorithm
Probabilistic algorithms for computing resultants
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Efficient parallel factorization and solution of structured and unstructured linear systems
Journal of Computer and System Sciences
On algorithms for solving systems of polynomial equations
ACM SIGSAM Bulletin
A note on abnormal polynomial remainder sequences
ACM SIGSAM Bulletin
An improved non-modular polynomial GCD algorithm
ACM SIGSAM Bulletin
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
An elementary proof of Sylvester's double sums for subresultants
Journal of Symbolic Computation
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation
Proceedings of the 2007 international workshop on Symbolic-numeric computation
IEEE Transactions on Computers
Global minimization of rational functions and the nearest GCDs
Journal of Global Optimization
An improved EZ-GCD algorithm for multivariate polynomials
Journal of Symbolic Computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Congruence arithmetic algorithms for polynomial real zero determination
Journal of Computer and System Sciences
Birational properties of the gap subresultant varieties
Journal of Symbolic Computation
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation
Subresultants of two Hermite-Laurent series
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Proving formally the implementation of an efficient gcd algorithm for polynomials
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Recursive polynomial remainder sequence and the nested subresultants
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Computing high precision Matrix Padé approximants
Numerical Algorithms
Improved polynomial remainder sequences for ore polynomials
ACM Communications in Computer Algebra
Improved polynomial remainder sequences for Ore polynomials
Journal of Symbolic Computation
| Hi-index | 0.01 |