Author:
Palko Vladimír,Sýkora Ondrej,Vrťo Imrich
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Baudet,G.M.: On the Area Required by VLSI Circuits. In: VLSI Systems and Computations, Rockville, Comp. Sci. Press 1981, 100–107.
2. Baudet,G.M., Wen Chin Chen: Area-time Tradeoffs for Merging. In: Proc. VLSI: Algorithms and Architectures, North Holland, 1985, 61–68.
3. Bilardi,G., Preparata,F.P.: The Influence of Key Length on the Area-time Complexity of Sorting. In: Proc. 12th ICALP, 1985.
4. Bilardi, G.,Preparata, F.P.: Area-time Lower Bound Technique with Application to Sorting. Algorithmica, 1, 1, 1986, 65–91.
5. Brent, R.P., Kung, H.T.: The Chip Complexity of Binary Arithmetic. JACM, 28, 3, 1981, 521–534.