On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
Fast algorithms for the characteristic polynomial
Theoretical Computer Science
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Addition requirements for matrix and transposed matrix products
Journal of Algorithms
Parallel evaluation of the determinant and of the inverse of a matrix
Information Processing Letters
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Parallel least-squares solution of general and Toeplitz systems
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
FCT '85 Fundamentals of Computation Theory
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On computing determinants of matrices without divisions
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Subquadratic-time factoring of polynomials over finite fields
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
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
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
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast rectangular matrix multiplications and improving parallel matrix computations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Processor-efficient parallel matrix inversion over abstract fields: two extensions
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient parallel computations for singular band matrices
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimum parallel computations with banded matrices
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Acceleration of Euclidean algorithm and extensions
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
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A block Wiedemann rank algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Some recent progress in exact linear algebra and related questions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Fast generalized bruhat decomposition
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Journal of Symbolic Computation
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
| Hi-index | 0.00 |