1. C. D. Thompson, “A Complexity Theory for VLSI,“ Ph.D. Thesis, Dept. of Comp. Science, Carnegie-Mellon Univ.; August 1980.
2. R. P. Brent and H. T. Kung, “The chip complexity of binary arithmetic,“ Journal of the ACM, vol. 28, n. 3, pp. 521–534; July 1981.
3. J. Vuillemin, “A combinatorial limit to the computing power of VLSI circuits,“ IEEE Trans. on Comp. vol. C-32, n. 3, pp. 294–300, March 1983.
4. G. Bilardi and F. P. Preparata, “Square tessellation techniques for area-time lower bounds,“ submitted for publication.
5. G. Bilardi, “The Area-Time Complexity of Sorting,“ Ph.D. Thesis, Univ. of Illinois, 1984.