Skip to main content
SpringerLink
Log in

Area complexity of merging

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1989 (MFCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 379))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. Baudet,G.M.: On the Area Required by VLSI Circuits. In: VLSI Systems and Computations, Rockville, Comp. Sci. Press 1981, 100–107.

    Google Scholar 

  2. Baudet,G.M., Wen Chin Chen: Area-time Tradeoffs for Merging. In: Proc. VLSI: Algorithms and Architectures, North Holland, 1985, 61–68.

    Google Scholar 

  3. Bilardi,G., Preparata,F.P.: The Influence of Key Length on the Area-time Complexity of Sorting. In: Proc. 12th ICALP, 1985.

    Google Scholar 

  4. Bilardi, G.,Preparata, F.P.: Area-time Lower Bound Technique with Application to Sorting. Algorithmica, 1, 1, 1986, 65–91.

    Google Scholar 

  5. Brent, R.P., Kung, H.T.: The Chip Complexity of Binary Arithmetic. JACM, 28, 3, 1981, 521–534.

    Google Scholar 

  6. Cole,R., Siegel,A.R.: On Information Flow and Sorting. New Upper and Lower Bounds for VLSI Circuits. In: Proc. 26th FOCS, Portland, 1985, 208–221.

    Google Scholar 

  7. Ďuriš, P., Sýkora, O., Thompson, C.D., Vrťo, I.: Tight Chip Area Bounds for Sorting. Computers and Artificial Intelligence, 4, 6, 1985, 535–544.

    Google Scholar 

  8. Ďuriš, P., Sýkora, O., Thompson, C.D., Vrťo, I.: A Minimum Area for 1-Selection. Algorithmica, 2, 2, 1987, 251–265.

    Google Scholar 

  9. Siegel, A.R.: A Minimum Storage Sorting Networks. IEEE Trans. on Computers, C-34, 4, 1985, 355–361.

    Google Scholar 

  10. Thompson,C.D., Yasuura, H.: On the Area-time Optimal Design of 1-Selectors. In: Proc. Asilomar Conf. on Circuits, Systems and Computers, 1985.

    Google Scholar 

  11. Vrťo, I.: Area-time Tradeoffs for Selection. In: Proc. Parallel Algorithms and Architectures, LNCS 269, Springer Verlag, 1987, 163–168.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Vladimír Palko, Ondrej Sýkora & Imrich Vrťo

Authors
  1. Vladimír Palko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondrej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Imrich Vrťo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palko, V., Sýkora, O., Vrťo, I. (1989). Area complexity of merging. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation