Advertisement

Area-time tradeoffs for selection

  • Imrich Vrťo
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 269)

Abstract

We prove nearly optimal lower and upper bounds on the AT2 complexity of the problem of selecting the l-th smallest from a set of integers. Our VLSI model satisfies the property that I/O ports Lie on the border of the circuit.

Keywords

Boolean Function Boundary Model Input Assignment VLSI Model Information Content Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [1]
    Bilardi, G., Preparata, F.P.: Area-time Lower bound technique with application to sorting. Algorithmica,1, 1986,1, 65–91.Google Scholar
  2. [2]
    Bilardi,G.,Preparata,F.P.: The influence of key length on the area-time complexity of sorting. In: Proc. 12-th ICALP, 1985.Google Scholar
  3. [3]
    Cole,R.,Siegel,A.R.: On information flow and sorting. In: Proc. 26-th FOCS, Portland 1985, 208–221.Google Scholar
  4. [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.Google Scholar
  5. [5]
    Ďuriš,P.,Sýkora,O., Thompson,C.D.,Vrťo,I.: A minimum area for l-selection. To appear in Algorithmica 1987.Google Scholar
  6. [6]
    Leighton,F.T.: Tight bounds on the complexity of parallel sorting. In: Proc. 16-th STOC, Washington 1984, 71–80.Google Scholar
  7. [7]
    Lipton,R.J.,Sedgewick,R.: Lower bounds for VLSI. In: Proc. 13-th STOC, Milwaukee 1981, 300–306.Google Scholar
  8. [8]
    Siegel, A.R.: Tight area bounds and provably good AT2 bounds for sorting circuits. Tech. Rep., Comp.Sci.Dept., New York University, New York 1984.Google Scholar
  9. [9]
    Siegel,A.R.: Aspects of information flow in VLSI circuits. In:Proc. 18-th STOC, 1986, 448–459.Google Scholar
  10. [10]
    Thompson,C.D.: Area-time complexity for VLSI. In: Proc. 11-th STOC, 1979, 81–88.Google Scholar
  11. [11]
    Thompson,C.D.,Yasuura,H.: On the area-time optimal design of l-selectors. In: Proc. Asilomar Conf. on Circuits, Systems and Computers, 1985.Google Scholar
  12. [12]
    Ullman,J.D.: Computational Aspects of VLSI. Rockville, Computer Science Press 1984.Google Scholar
  13. [13]
    Vrťo, I.: Optimal VLSI algorithm for finding the maximum element of a set. In: Proc. PARCELLA "84, Berlin, Academie Verlag 1985,232–238.Google Scholar
  14. [14]
    Vrťo,I.: The area-time complexity of the VLSI counter. Submitted to IPL.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Imrich Vrťo
    • 1
  1. 1.Institute of Technical CyberneticsSlovak Academy of SciencesBratislavaCzechoslovakia

Personalised recommendations