Lower bounds on arithmetic circuits via partial derivatives

Fast Parallel Computation of Polynomials Using Few Processors

Leslie G. Valiant, Sven Skyum, S. J. Berkowitz et al. · SIAM Journal on Computing · 1983 · 283 citations

Computing, Computer Science, Mathematics +10

Lower bounds for non-commutative computation

Noam Nisan · 1991 · 203 citations

Computing, Computer Science, Algorithms +6

On the average number of rebalancing operations in weight-balanced trees

Norbert Blüm, Kurt Mehlhorn · Theoretical Computer Science · 1980 · 69 citations · Full text

Computing, Computer Science, Algorithms +2

Negation can be exponentially powerful

Leslie G. Valiant · Theoretical Computer Science · 1980 · 66 citations

Computing, Computer Science, Mathematics +12

A certain class of incidence matrices

Daniel Henry Gottlieb · Proceedings of the American Mathematical Society · 1966 · 64 citations

Natural Sciences, Computer Science, Mathematics +11