Graphs and algorithms
How can we speed up matrix multiplication?
SIAM Review
Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: symbolic and algebraic computation (2nd ed.)
How to multiply matrices faster
How to multiply matrices faster
Computer algebra: symbolic and algebraic computation (2nd ed.)
Algebraic geometry for computer-aided geometric design
IEEE Computer Graphics and Applications
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Direct methods for sparse matrices
Direct methods for sparse matrices
On the worst-case arithmetic complexity of approximating zeros of polynomials
Journal of Complexity
The analysis of a nested dissection algorithm
Numerische Mathematik
Complexity of parallel matrix computations
Theoretical Computer Science
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
Computer algebra: systems and algorithms for algebraic computation
Computer algebra: systems and algorithms for algebraic computation
Information Processing Letters
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On arithmetical algorithms over finite fields
Journal of Combinatorial Theory Series A
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Quantifier elimination and the sign variation method for real root isolation
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Generalised characteristic polynomials
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Journal of Symbolic Computation - Special issue on computational algebraic complexity
An improved Newton interaction for the generalized inverse of a Matrix, with applications
SIAM Journal on Scientific and Statistical Computing
Parallel algorithms for sparse linear systems
SIAM Review
Efficient techniques for multipolynomial resultant algorithms
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Mathematics for computer algebra
Mathematics for computer algebra
Parallel complexity of tridiagonal symmetric Eigenvalue problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A heuristic irreducibility test for univariate polynomials
Journal of Symbolic Computation
SIAM Journal on Scientific and Statistical Computing - Special issue on iterative methods in numerical linear algebra
Algorithms for computer algebra
Algorithms for computer algebra
Highly parallel sparse Cholesky factorization
SIAM Journal on Scientific and Statistical Computing
Symbolic parametrization of curves
Journal of Symbolic Computation
Factoring polynomials via relation-finding
ISTCS'92 Symposium proceedings on Theory of computing and systems
Polynomial division with a remainder by means of evaluation and interpolation
Information Processing Letters
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
A bibliography on roots of polynomials
Journal of Computational and Applied Mathematics
Fast and efficient parallel solution of sparse linear systems
SIAM Journal on Computing
Algebraic and numeric techniques in modeling and robotics
Algebraic and numeric techniques in modeling and robotics
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
Mathematics of Computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
On computing sparse shifts for univariate polynomials
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Sparse Polynomial Interpolation in Nonstandard Bases
SIAM Journal on Computing
On parallel computations with banded matrices
Information and Computation
Work-preserving speed-up of parallel matrix computations
SIAM Journal on Computing
Nearly Optimal Algorithms For Canonical Matrix Forms
SIAM Journal on Computing
Proceedings of the 1995 international symposium on Symbolic and algebraic computation
International Symposium on Symbolic and Algebraic Computation
Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
The singular value decomposition for polynomial systems
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
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
On the complexity of sparse elimination
Journal of Complexity
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Theoretical Computer Science
Algorithmic number theory
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
SIAM Journal on Scientific Computing
On the rapid computation of various polylogarithmic constants
Mathematics of Computation
Matrix computations (3rd ed.)
Parametrization of algebraic curves over optimal field extensions
Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
Fast algorithms for Taylor shifts and certain difference equations
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On randomized Lanczos algorithms
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of subresultants
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Iterative methods for solving linear systems
Iterative methods for solving linear systems
Applied numerical linear algebra
Applied numerical linear algebra
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The symmetric eigenvalue problem
The symmetric eigenvalue problem
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
SIAM Journal on Computing
Sign determination in residue number systems
Theoretical Computer Science - Special issue on real numbers and computers
Fast deterministic computation of determinants of dense matrices
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Matrices in elimination theory
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Solving degenerate sparse polynomial systems faster
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Certified computation of the sign of a matrix determinant
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Integer Arithmetic Algorithms for Polynomial Real Zero Determination
Journal of the ACM (JACM)
Multivariate Polynomial Factorization
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
An updated supplementary bibliography on roots of polynomials
Journal of Computational and Applied Mathematics
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
On the validity of implicitization by moving quadrics for rational surfaces with no base points
Journal of Symbolic Computation
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Multivariate polynomials, duality, and structured matrices
Journal of Complexity
Newton's iteration for structured matrices
Fast reliable algorithms for matrices with structure
Templates for the solution of algebraic eigenvalue problems: a practical guide
Templates for the solution of algebraic eigenvalue problems: a practical guide
Sylvester—Habicht sequences and fast Cauchy index computation
Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Structured matrices and polynomials: unified superfast algorithms
Structured matrices and polynomials: unified superfast algorithms
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
Numerical Linear Algebra for High Performance Computers
Numerical Linear Algebra for High Performance Computers
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Inversion of Displacement Operators
SIAM Journal on Matrix Analysis and Applications
An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Relations between roots and coefficients, interpolation and application to system solving
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
A 2002 update of the supplementary bibliography on roots of polynomials
Journal of Computational and Applied Mathematics
Accelerated Solution of Multivariate Polynomial Systems of Equations
SIAM Journal on Computing
Acceleration of Euclidean Algorithm and Rational Number Reconstruction
SIAM Journal on Computing
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
An Efficient Algorithm for the Sparse Mixed Resultant
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Randomized Acceleration of Fundamental Matrix Computations
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A note on the complexity of constructing Gröbner-Bases
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
GCD's and Factoring Multivariate Polynominals Using Gröbner Bases
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Theoretical Computer Science - Latin American theoretical informatics
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On computing the determinant and Smith form of an integer matrix
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Polynomial real root isolation using Descarte's rule of signs
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
An Algorithm for the Newton Resultant
An Algorithm for the Newton Resultant
Base points, resultants, and the implicit representation of rational surfaces
Base points, resultants, and the implicit representation of rational surfaces
The computation of puiseux expansions and a quantitative version of runge's theorem on diophantine equations
Modern Computer Algebra
Multihomogeneous resultant formulae by means of complexes
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
The resultant of an unmixed bivariate system
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
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
On Rational Number Reconstruction and Approximation
SIAM Journal on Computing
Numerical Polynomial Algebra
Inversion of parameterized hypersurfaces by means of subresultants
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Theoretical Computer Science - Algebraic and numerical algorithm
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
Iterative inversion of structured matrices
Theoretical Computer Science - Algebraic and numerical algorithm
Solving Polynomial Equations: Foundations, Algorithms, and Applications (Algorithms and Computation in Mathematics)
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
High-performance implementations of the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic-Numeric Computation (Trends in Mathematics)
Symbolic-Numeric Computation (Trends in Mathematics)
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Complexity of real root isolation using continued fractions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Eigen-solving via reduction to DPR1 matrices
Computers & Mathematics with Applications
Safe and effective determinant evaluation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problem
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Schur aggregation for linear systems and determinants
Theoretical Computer Science
Computational Commutative Algebra 1
Computational Commutative Algebra 1
A Singular Introduction to Commutative Algebra
A Singular Introduction to Commutative Algebra
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
The amended DSeSC power method for polynomial root-finding
Computers & Mathematics with Applications
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
New bounds for the Descartes method
Journal of Symbolic Computation
Algebraic Complexity Theory
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Parallel computation of a Krylov matrix for a sparse and structured input
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |