Computer Algebra: Past and Future
Journal of Symbolic Computation
Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The parallel complexity of exponentiating polynomials over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fast parallel algorithms for similarity of matrices
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The parallel complexity of exponentiating polynomials over finite fields
Journal of the ACM (JACM)
Parallelism and algorithms for algebraic manipulation: current work
ACM SIGSAM Bulletin
Quantifier elimination in the theory of an algebraically-closed field
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computing primitive elements of extension fields
Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation
Analysis of euclidean algorithms for polynomials over finite fields
Journal of Symbolic Computation
Arithmetic with real algebraic numbers is in NC
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Parallel least-squares solution of general and Toeplitz systems
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the Euclidean scheme for polynomials having interlaced real zeros
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Functional decomposition of polynomials: The wild case
Journal of Symbolic Computation
Parallel lattice basis reduction
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Specified precision polynomial root isolation is in NC
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Fast parallel computation of the Smith normal form of polynomial matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Complexity of the Wu-Ritt decomposition
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Interpolation of sparse multivariate polynomials over large finite fields with applications
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical Computer Science - Latin American theoretical informatics
Computer algebra handbook
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Some polynomial and Toeplitz matrix computations
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.01 |