Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
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
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
Mathematics of Computation
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
SIAM Journal on Matrix Analysis and Applications
Mathematics of Computation
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Matrix-free linear system solving and applications to symbolic computation
Matrix-free linear system solving and applications to symbolic computation
On randomized Lanczos algorithms
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Computational aspects of discrete logarithms
Computational aspects of discrete logarithms
A block Lanczos algorithm for finding dependencies over GF(2)
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
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
Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
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
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Computation of Discrete Logarithms in F2607
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Analysis of Bernstein's Factorization Circuit
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An output-sensitive variant of the baby steps/giant steps determinant algorithm
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
Computer algebra handbook
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
Reliable Krylov-based algorithms for matrix null space and rank
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A reliable block Lanczos algorithm over small finite fields
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
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
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Scalable hardware for sparse systems of linear equations, with applications to integer factorization
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
On the complexity of solving quadratic Boolean systems
Journal of Complexity
On the matrix berlekamp-massey algorithm
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |