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
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On computing determinants of matrices without divisions
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
The computational complexity of recognizing permutation functions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Parallel distinct degree factorization algorithm
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Faster solution of the key equation for decoding BCH error-correcting codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division
Cybernetics and Systems Analysis
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Journal of Symbolic Computation
Hensel lifting and bivariate polynomial factorisation over finite fields
Mathematics of Computation
Polynomial factorization over F2
Mathematics of Computation
Acceleration of Euclidean algorithm and extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Relaxed mltiplication using the middle product
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Five, Six, and Seven-Term Karatsuba-Like Formulae
IEEE Transactions on Computers
Essentially optimal computation of the inverse of generic polynomial matrices
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
Multivariate power series multiplication
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Computing the rank and a small nullspace basis of a polynomial matrix
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
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
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
Faster inversion and other black box matrix computations using efficient block projections
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: from theory to practice
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic computation
New algorithms for relaxed multiplication
Journal of Symbolic Computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Change of order for regular chains in positive dimension
Theoretical Computer Science
Journal of Symbolic Computation
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
On lacunary polynomial perfect powers
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first 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
Fast arithmetic for triangular sets: From theory to practice
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Space- and time-efficient polynomial multiplication
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Code Generation for Polynomial Multiplication
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Fast computation of special resultants
Journal of Symbolic Computation
Newton's method and FFT trading
Journal of Symbolic Computation
Exact sparse matrix-vector multiplication on GPU's and multicore architectures
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
An in-place truncated fourier transform and applications to polynomial multiplication
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Journal of Symbolic Computation
Chunky and equal-spaced polynomial multiplication
Journal of Symbolic Computation
Fast fourier transforms over poor fields
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Faster polynomial multiplication via discrete fourier transforms
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Homotopy techniques for multiplication modulo triangular sets
Journal of Symbolic Computation
Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series
Mathematical and Computer Modelling: An International Journal
Elliptic periods for finite fields
Finite Fields and Their Applications
Tests for Permutation Functions
Finite Fields and Their Applications
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
Improving the berlekamp algorithm for binomials xn-a
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On fast division algorithm for polynomials using newton iteration
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Complexity estimates for two uncoupling algorithms
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.01 |