On the extended direct sum conjecture
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Multilinear algebra and parallel programming
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Modified ranks of tensors and the size of circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Class of Low Complexity High Concurrence Algorithms
IEEE Transactions on Parallel and Distributed Systems
Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the complexity of the multiplication of matrices of small formats
Journal of Complexity
The complexity of bivariate power series arithmetic
Theoretical Computer Science - Mathematical foundations of computer science
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Beyond the Alder-Strassen bound
Theoretical Computer Science - Automata, languages and programming
| Hi-index | 0.00 |