An efficient selection algorithm on the pyramid

DOI10.1016/0020-0190(94)00160-ZMaRDI QIDQ674295zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)00160-z

zbMATH Keywords

Parallel algorithmskth elementPyramid mode

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A parallel selection algorithm
• New algorithms for selection
• Efficient parallel k selection algorithm
• Efficient selection on a binary tree
• scientific article; zbMATH DE number 2079315

Cites work

• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Efficient selection on a binary tree
• Fast deterministic selection on mesh-connected processor arrays
• Sorting on a mesh-connected parallel computer

Cited in

(1)

• Proof that pyramid networks are 1-Hamiltonian-connected with high probability

This page was built for publication: An efficient selection algorithm on the pyramid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674295)