A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A fast parallel algorithm for determining all roots of a polynomial with real roots
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficient parallel solution of linear systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Quantifier elimination in the theory of an algebraically-closed field
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Arithmetic with real algebraic numbers is in NC
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
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
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On computing determinants of matrices without divisions
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
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Exponential space computation of Gröbner bases
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Resolvent computations by resultants without extraneous powers
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A combinatorial algorithm for the determinant
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Computational Discrete Mathematics
On the Minimal Polynomial of a Matrix
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science - Mathematical foundations of computer science
The complexity of tensor calculus
Computational Complexity
Deformation techniques to solve generalised Pham systems
Theoretical Computer Science - Algebraic and numerical algorithm
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Differential forms in computational algebraic geometry
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Change of order for regular chains in positive dimension
Theoretical Computer Science
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the complexity of counting components of algebraic varieties
Journal of Symbolic Computation
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Evaluation properties of invariant polynomials
Journal of Symbolic Computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On a generalization of Stickelberger's Theorem
Journal of Symbolic Computation
Exponential time complexity of the permanent and the Tutte polynomial
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Formal theories for linear algebra
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing
Short proofs for the determinant identities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Separating multilinear branching programs and formulas
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Information Processing Letters
| Hi-index | 0.89 |