Parallel algorithms for algebraic problems
SIAM Journal on Computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Structure of Computers and Computations
Structure of Computers and Computations
Comparison of arithmetic functions with respect to boolean circuit depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Polynomial decomposition algorithms
Journal of Symbolic Computation
Fast parallel computation of the Smith normal form of polynomial matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
From randomizing polynomials to parallel algorithms
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
| Hi-index | 0.00 |