Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
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
Multipolynomial resultants and linear algebra
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
On computing sparse shifts for univariate polynomials
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 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
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
FOXBOX: a system for manipulating symbolic objects in black box representation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
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
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Simulation-Based Functional Test Generation for Embedded Processors
IEEE Transactions on Computers
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
A new algorithm for sparse interpolation of multivariate polynomials
Theoretical Computer Science
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
A local decision test for sparse polynomials
Information Processing Letters
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Implicitization of curves and (hyper)surfaces using predicted support
Theoretical Computer Science
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.01 |