1. Bilardi, G., Preparata, F.P.: Area-time Lower bound technique with application to sorting. Algorithmica,1, 1986,1, 65–91.
2. Bilardi,G.,Preparata,F.P.: The influence of key length on the area-time complexity of sorting. In: Proc. 12-th ICALP, 1985.
3. Cole,R.,Siegel,A.R.: On information flow and sorting. In: Proc. 26-th FOCS, Portland 1985, 208–221.
4. Ďuriš, P.,Sýkora, O.,Thompson, C.D.,Vrťo, I.: Tight chip area bounds for sorting. Computers and Artificial Intelligence, 4, 1985, 6, 535–544.
5. Ďuriš,P.,Sýkora,O., Thompson,C.D.,Vrťo,I.: A minimum area for l-selection. To appear in Algorithmica 1987.