On the Additive Complexity of Polynomials.
Theor. Comput. Sci., 1980
An Omega(n/lg n)<sup>1/2</sup> Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials.
Inf. Process. Lett., 1979
An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex Numbers
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
On the Additive Complexity of Specific Polynomials.
Inf. Process. Lett., 1975