Hermite normal form computation using modulo determinant arithmetic
Mathematics of Operations Research
Fast parallel computation of hermite and smith forms of polynomial matrices
SIAM Journal on Algebraic and Discrete Methods
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Asymptotically fast triangularization of matrices over rings
SIAM Journal on Computing
Nearly optimal algorithms for canonical matrix forms
Nearly optimal algorithms for canonical matrix forms
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Near optimal algorithms for computing Smith normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the worst-case complexity of integer Gaussian elimination
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A solution to the extended GCD problem with applications
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The modulo N extended GCD problem for polynomials
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On the computation of elementary divisors of integer matrices
Journal of Symbolic Computation
Randomized Acceleration of Fundamental Matrix Computations
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Computer algebra handbook
Efficient parallelizations of Hermite and Smith normal form algorithms
Parallel Computing
GCD of many integers (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The complexity of solving linear equations over a finite ring
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]
Journal of Symbolic Computation
| Hi-index | 0.00 |