Optimal parallel selection in sorted matrices

Hong Shen, Sarnath Ramnath

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We present a parallel algorithm running in time O(log m log(Black star) m (log log m + log(n/m))) time and O(m log(n/m)) operations on an EREW PRAM for the problem of selection in an m × n matrix with sorted rows and columns, m ≤ n. Our algorithm generalizes the result of Sarnath and He (1992) for selection in a sorted matrix of equal dimensions, and thus answers the open question they posted. The algorithm is work-optimal thus improving upon the result in (Sarnath and He, 1992) for the case of square matrices as well. Our algorithm can be generalized to solve the selection problem on a set of sorted matrices of arbitrary dimensions.

Original languageEnglish
Pages (from-to)117-122
Number of pages6
JournalInformation Processing Letters
Issue number3
Publication statusPublished - 12 Aug 1996
Externally publishedYes


  • Parallel algorithms
  • Selection
  • Sorted matrix
  • Time complexity


Dive into the research topics of 'Optimal parallel selection in sorted matrices'. Together they form a unique fingerprint.

Cite this