Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
On the equivalence between Berlekamp's and Euclid's algorithms
IEEE Transactions on Information Theory
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM Journal on Computing
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Sparse Polynomial Interpolation in Nonstandard Bases
SIAM Journal on Computing
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 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
FOXBOX: a system for manipulating symbolic objects in black box representation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
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)
Improved Sparse Multivariate Polynomial Interpolation Algorithms
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Early termination over small fields
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A new algorithm for sparse interpolation of multivariate polynomials
Theoretical Computer Science
Sparse multivariate polynomial interpolation via the quotient-difference algorithm
ACM Communications in Computer Algebra
Symbolic-numeric sparse interpolation of multivariate rational functions
ACM Communications in Computer Algebra
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
On sparse interpolation over finite fields
ACM Communications in Computer Algebra
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
| Hi-index | 0.00 |