Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Arithmetic Circuits and Polynomial Replacement Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Functions computable in polynomial space
Information and Computation
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Two dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
Functions computable in polynomial space
Information and Computation
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |