Skip to main content
Springer Nature Link
Log in

On “an improved algorithm for finding the median distributively” [1]

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In [1] Algorithm III is proposed as a solution to the problem of finding the median of a multiset distributed on two processes. In this note it is shown how this algorithm fails to find the median and how it can be corrected.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Chin and H. F. Ting, An improved algorithm for finding the median distributively,Algorithmica,2 (1987), 235–249.

    MathSciNet  Google Scholar 

  2. M. Rodeh, Finding the median distributively,J. Comput. System Sci.,24 (1982), 162–166.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Athens University of Economics, 76 Patission Street, 104 34, Athens, Greece

    S. L. Mantzaris

Authors
  1. S. L. Mantzaris
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Communicated by Franco P. Preparata.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mantzaris, S.L. On “an improved algorithm for finding the median distributively” [1]. Algorithmica 10, 501–504 (1993). https://doi.org/10.1007/BF01891834

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words