Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials
Mathematics of Operations Research
The complexity of robot motion planning
The complexity of robot motion planning
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Generalized Characteristic Polynomials
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Improved Sparse Multivariate Polynomial Interpolation Algorithms
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Generalised characteristic polynomials
Journal of Symbolic Computation - Special issue on computational algebraic complexity
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
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Computing selected solutions of polynomial equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Controlled iterative methods for solving polynomial systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Elimination and Resultants - Part 1: Elimination and Bivariate Resultants
IEEE Computer Graphics and Applications
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Symbolic Computation
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic 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
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Solving structured linear systems with large displacement rank
Theoretical Computer Science
Resultants of partially composed polynomials
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Schema-guided synthesis of imperative programs by constraint solving
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On the complexity of solving quadratic Boolean systems
Journal of Complexity
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |