The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Certified computation of the sign of a matrix determinant
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Sparse approximate solutions to semidefinite programs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A Randomized Algorithm for Principal Component Analysis
SIAM Journal on Matrix Analysis and Applications
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
A deterministic algorithm for the Frieze-Kannan regularity lemma
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
An Algorithm for the Principal Component Analysis of Large Data Sets
SIAM Journal on Scientific Computing
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
Optimizing over the growing spectrahedron
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ACM Transactions on Mathematical Software (TOMS)
Probabilistic Upper Bounds for the Matrix Two-Norm
Journal of Scientific Computing
| Hi-index | 0.01 |