Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On the Newton Polytope of the Resultant
Journal of Algebraic Combinatorics: An International Journal
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
On the complexity of sparse elimination
Journal of Complexity
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Theoretical Computer Science
Solving special polynomial systems by using structured matrices and algebraic residues
FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Solving Systems of Polynomial Equations
IEEE Computer Graphics and Applications
An Efficient Algorithm for the Sparse Mixed Resultant
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Improved Sparse Multivariate Polynomial Interpolation Algorithms
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
An Algorithm for the Newton Resultant
An Algorithm for the Newton Resultant
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Controlled iterative methods for solving polynomial systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing integer points in Minkowski sums
Proceedings of the sixteenth annual symposium on Computational geometry
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Sparse resultant of composed polynomials I* mixed-unmixed case
Journal of Symbolic Computation
Sparse resultant of composed polynomials II unmixed--mixed case
Journal of Symbolic Computation
Factoring sparse resultants of linearly combined polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Sparse Resultant under Vanishing Coefficients
Journal of Algebraic Combinatorics: An International Journal
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Resultants of partially composed polynomials
Journal of Symbolic Computation
| Hi-index | 0.00 |