Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Algebra and Number Theory
Reference24 articles.
1. G. M. Baudet,Design and Complexity of VLSI Algorithms, in Foundation of Computer Science IV (1983).
2. G. Bilardi, M. Pracchi, F. P. Preparata,A Critique and an Appraisal of VLSI Models of Computation, in VLSI Systems and Computations (1981).
3. G. Bilardi andF. P. Preparata,Area-Time Lower-Bound Techniques with Applications to Sorting, Algorithmica, 1 (1986) to appear.
4. A. Bojanczyk, R. P. Brent andH., T. Kung,Numerical Stable Solution of Dense Systems of Linear Equations using Mesh-Connected Processors, Tech. Rep. Carnegie-Mellon (1981).
5. R. P. Brent andH. T. Kung,The area-time Complexity of Binary Multiplication, J. Assoc. Comput. Mach, (1981), 521–534.