An efficient selection algorithm on the pyramid

DOI10.1016/0020-0190(94)00160-ZzbMath0875.68527OpenAlexW2064445455MaRDI QIDQ674295

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)

Related Items (1)

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

Cites Work

• Efficient selection on a binary tree
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Fast deterministic selection on mesh-connected processor arrays
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Unnamed Item

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