Skip to main content
SpringerLink
Log in

Book review

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Ajtai M, Komlós J, Szemerédi E (1983) An 0(n log n) sorting network. In: Proc. 15th Ann. ACM Symp. Theory Comput., Boston, Mass., April 1983, pp 1–9

  2. Ajtai M, Komlós J, Szemerédi E (1985) Sorting inc logn parallel steps. Combinatorica 3:1–19

    Google Scholar 

  3. Akl SG (1984) An optimal algorithm for parallel selection. Information Processing Lett 19:47–50

    Google Scholar 

  4. Akl SG (1984) Optimal parallel algorithms for computing convex hulls and for sorting. Computing 33:1–11

    Google Scholar 

  5. Nassimi D, Sahni S (1979) Bitonic sort on a mesh-connected parallel computer. IEEE Trans Computers C-28:2–7

    Google Scholar 

  6. Nassimi D, Sahni S (1982) Parallel permutation and sorting algorithms and a new generalized connection network. J Assoc Comput Mach 29:642–667

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graz

    Günter Rote

  2. Praha

    M. Vlach

Authors
  1. Günter Rote
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Vlach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rote, G., Vlach, M. Book review. Zeitschrift für Operations Research 31, A69–A70 (1987). https://doi.org/10.1007/BF01258609

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01258609

Search

Navigation