Optimal parallel selection in sorted matrices

DOI10.1016/0020-0190(96)00100-7zbMath0900.68238OpenAlexW2022207429WikidataQ126590514 ScholiaQ126590514MaRDI QIDQ671400

Hong Shen, Sarnath Ramnath

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00100-7

zbMATH Keywords

Parallel algorithmsEREW PRAMSelectionSorted matrixTime complexity

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (2)

Optimal algorithms for generalized searching in sorted matrices ⋮ A centroid labelling technique and its application to path selection in trees

Cites Work

• Optimal parallel algorithms for computing convex hulls and for sorting
• A parallel median algorithm
• An optimally efficient selection algorithm
• Improved universal \(k\)-selection in hypercubes
• Finding the median
• On parallel selection and searching in partial orders: Sorted matrices
• Time bounds for selection
• Generalized Selection and Ranking: Sorted Matrices
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Bounds for Selection
• A lower bound for sorting networks based on the shuffle permutation
• The Parallel Simplicity of Compaction and Chaining

This page was built for publication: Optimal parallel selection in sorted matrices