Skip to main content
SpringerLink
Log in
Book cover

Parallel Algorithms and Architectures pp 163–168Cite as

Area-time tradeoffs for selection

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. Bilardi, G., Preparata, F.P.: Area-time Lower bound technique with application to sorting. Algorithmica,1, 1986,1, 65–91.

    Google Scholar 

  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. Cole,R.,Siegel,A.R.: On information flow and sorting. In: Proc. 26-th FOCS, Portland 1985, 208–221.

    Google Scholar 

  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. Ď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. Leighton,F.T.: Tight bounds on the complexity of parallel sorting. In: Proc. 16-th STOC, Washington 1984, 71–80.

    Google Scholar 

  7. Lipton,R.J.,Sedgewick,R.: Lower bounds for VLSI. In: Proc. 13-th STOC, Milwaukee 1981, 300–306.

    Google Scholar 

  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. Siegel,A.R.: Aspects of information flow in VLSI circuits. In:Proc. 18-th STOC, 1986, 448–459.

    Google Scholar 

  10. Thompson,C.D.: Area-time complexity for VLSI. In: Proc. 11-th STOC, 1979, 81–88.

    Google Scholar 

  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. Ullman,J.D.: Computational Aspects of VLSI. Rockville, Computer Science Press 1984.

    Google Scholar 

  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. Vrťo,I.: The area-time complexity of the VLSI counter. Submitted to IPL.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Technical Cybernetics, Slovak Academy of Sciences, Dúbravská 9, 842 37, Bratislava, Czechoslovakia

    Imrich Vrťo

Authors
  1. Imrich Vrťo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vrťo, I. (1987). Area-time tradeoffs for selection. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation