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
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Asymptotically fast solution of Toeplitz-like singular linear systems
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On rank properties of Toeplitz matrices over finite fields
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
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Certifying inconsistency of sparse linear systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Nearly optimal computations with structured matrices
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Rational solutions of singular linear systems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Black box methods for least squares problems
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Computer algebra handbook
The black-box Niederreiter algorithm and its implementation over the binary field
Mathematics of Computation
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Signature of symmetric rational matrices and the unitary dual of lie groups
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
Preconditioners for singular black box matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A block Wiedemann rank algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Lifting and recombination techniques for absolute factorization
Journal of Complexity
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical techniques for computing the inertia of products of matrices of rational numbers
Proceedings of the 2007 international workshop on Symbolic-numeric 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
Efficient matrix rank computation with application to the study of strongly regular graphs
Proceedings of the 2007 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
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic 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
Solving structured linear systems with large displacement rank
Theoretical Computer Science
On finding multiplicities of characteristic polynomial factors of black-box matrices
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding
Proceedings of the 2009 conference on Symbolic numeric computation
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Exact sparse matrix-vector multiplication on GPU's and multicore architectures
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Journal of Symbolic Computation
Randomized preconditioning of the MBA algorithm
Proceedings of the 36th international symposium on Symbolic and algebraic computation
An output-sensitive algorithm for persistent homology
Proceedings of the twenty-seventh annual symposium on Computational geometry
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A note on the factorization method of Niederreiter
Finite Fields and Their Applications
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On the complexity of solving quadratic Boolean systems
Journal of Complexity
An output-sensitive algorithm for persistent homology
Computational Geometry: Theory and Applications
On the matrix berlekamp-massey algorithm
ACM Transactions on Algorithms (TALG)
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
ACM Communications in Computer Algebra
| Hi-index | 0.00 |