Selection on k-Dimensional Meshes with Multiple Broadcasting

DOI10.1093/COMJNL/39.2.140MaRDI QIDQ4886688zbMATH OpenOpenAlexFDO

Authors Mounir Hamdi, Gurdip Singh, Yi Pan

Publication date 30 October 1996

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/39.2.140

zbMATH Keywords

multiple broadcastingrandomized selection algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Fast deterministic selection on mesh-connected processor arrays
• Unifying themes for selection on any network
• Selection on rectangular meshes with multiple broadcasting
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
• Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses

Cited in

(10)

• Distributed algorithms for selection in sets
• Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting
• Unifying themes for selection on any network
• Upper and lower bounds for selection on the mesh
• Fast deterministic selection on mesh-connected processor arrays
• Selection on rectangular meshes with multiple broadcasting
• Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
• scientific article; zbMATH DE number 1026282 (Why is no real title available?)
• scientific article; zbMATH DE number 1760013 (Why is no real title available?)
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers

This page was built for publication: Selection on k-Dimensional Meshes with Multiple Broadcasting

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