Parallel polynomial computations by recursive processes
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Factoring modular polynomials (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Approximate complex polynomial evaluation in near constant work per point
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Computing exact geometric predicates using modular arithmetic with single precision
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fast rectangular matrix multiplications and improving parallel matrix computations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic 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
The Journal of Supercomputing - Special issue: high performance computing systems
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
IEEE Transactions on Parallel and Distributed Systems
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)
IEEE Transactions on Computers
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
How fast can we compute products?
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Efficient parallel computations for singular band matrices
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Certified computation of the sign of a matrix determinant
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Computers
A parallel block algorithm for exact triangularization of rectangular matrices
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A generalized Graeffe's iteration for evaluating polynomials and rational functions
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Predicting zero coefficients in formal power series computations
Journal of Symbolic Computation
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Load-balanced parallel banded-system solvers
Theoretical Computer Science
On Polynomial and Polynomial Matrix Interpolation
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On parallel block algorithms for exact triangularizations
Parallel Computing
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
Scalable public-key tracing and revoking
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Computer algebra handbook
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Theoretical Computer Science - Algebraic and numerical algorithm
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
Theoretical Computer Science - Algebraic and numerical algorithm
Theoretical Computer Science - Algebraic and numerical algorithm
Iterative inversion of structured matrices
Theoretical Computer Science - Algebraic and numerical algorithm
Inverses of Multivariable Polynomial Matrices by Discrete Fourier Transforms
Multidimensional Systems and Signal Processing
Fast and Scalable Parallel Matrix Computations on Distributed Memory Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
On computing nearest singular hankel matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Pivoting for structured matrices and rational tangential interpolation
Contemporary mathematics
Inversion of Toeplitz-plus-Hankel matrices with arbitrary rank profile
Contemporary mathematics
Scalable public-key tracing and revoking
Distributed Computing
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
Bernstein-Bezoutian matrices and curve implicitization
Theoretical Computer Science
Lifting and recombination techniques for absolute factorization
Journal of Complexity
IEEE Transactions on Parallel and Distributed Systems
Computing the topology of a real algebraic plane curve whose equation is not directly available
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Structured matrix-based methods for polynomial ∈-gcd: analysis and comparisons
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Differential equations for algebraic functions
Proceedings of the 2007 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
POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations
Proceedings of the 2007 international workshop on Parallel symbolic computation
A relaxation scheme for increasing the parallelism in Jacobi-SVD
Journal of Parallel and Distributed Computing
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
International Journal of Computer Mathematics
Theoretical Computer Science
Computations with quasiseparable polynomials and matrices
Theoretical Computer Science
Schur aggregation for linear systems and determinants
Theoretical Computer Science
A new Gröbner basis conversion method based on stabilization techniques
Theoretical Computer Science
Improving the Boneh-Franklin Traitor Tracing Scheme
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
The Journal of Supercomputing
Fast algorithms for multivariate interpolation and evaluation at special points
Journal of Complexity
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computing nearest Gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation
Computing multivariate approximate GCD based on Barnett's theorem
Proceedings of the 2009 conference on Symbolic numeric computation
Computing clustered close-roots of univariate polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
The amended DSeSC power method for polynomial root-finding
Computers & Mathematics with Applications
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
An authentication scheme based on the twisted conjugacy problem
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Real and complex polynomial root-finding with eigen-solving and preprocessing
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
A Strassen-like matrix multiplication suited for squaring and higher power computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
The Journal of Supercomputing
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
Theoretical Computer Science
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
Randomized preconditioning of the MBA algorithm
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science
Commutative version of the local Hamiltonian problem and common eigenspace problem
Quantum Information & Computation
Acceleration of the inversion of triangular Toeplitz matrices and polynomial division
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
A novel scheme for the parallel computation of SVDs
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Efficient polynomial root-refiners: A survey and new record efficiency estimates
Computers & Mathematics with Applications
A geometric algorithm for winding number computation with complexity analysis
Journal of Complexity
Parallel computation of a Krylov matrix for a sparse and structured input
Mathematical and Computer Modelling: An International Journal
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
Root-refining for a polynomial equation
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the boolean complexity of real root refinement
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.02 |