Area complexity of merging

  • Vladimír Palko
  • Ondrej Sýkora
  • Imrich Vrťo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)


Shift Register Area Complexity VLSI Circuit Merging Algorithm Radix Sort 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [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. [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. [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. [4]
    Bilardi, G.,Preparata, F.P.: Area-time Lower Bound Technique with Application to Sorting. Algorithmica, 1, 1, 1986, 65–91.Google Scholar
  5. [5]
    Brent, R.P., Kung, H.T.: The Chip Complexity of Binary Arithmetic. JACM, 28, 3, 1981, 521–534.Google Scholar
  6. [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. [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. [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. [9]
    Siegel, A.R.: A Minimum Storage Sorting Networks. IEEE Trans. on Computers, C-34, 4, 1985, 355–361.Google Scholar
  10. [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. [12]
    Vrťo, I.: Area-time Tradeoffs for Selection. In: Proc. Parallel Algorithms and Architectures, LNCS 269, Springer Verlag, 1987, 163–168.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Vladimír Palko
    • 1
  • Ondrej Sýkora
    • 1
  • Imrich Vrťo
    • 1
  1. 1.Institute of Technical CyberneticsSlovak Academy of SciencesBratislava

Personalised recommendations