On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
Fast parallel algorithms for similarity of matrices
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Parallelism and algorithms for algebraic manipulation: current work
ACM SIGSAM Bulletin
Algorithms for sparse rational interpolation
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Exponential space computation of Gröbner bases
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
The complexity of tensor calculus
Computational Complexity
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
From randomizing polynomials to parallel algorithms
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis
Fundamenta Informaticae
| Hi-index | 0.00 |