A fast maximum finding algorithm on broadcast communication

DOI10.1016/S0020-0190(96)00143-3zbMath1022.68740MaRDI QIDQ1350933

Shyue-Horng Shiau, Chang-Biau Yang

Publication date: 27 February 1997

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

zbMATH Keywords

parallel algorithmsbroadcast communicationmaximum finding

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication ⋮ Sorting algorithms for broadcast communications: mathematical analysis.

Cites Work

• Unnamed Item
• Distributed selectsort sorting algorithms on broadcast communication networks
• Reducing conflict resolution time for solving graph problems in broadcast communications
• Tree algorithms for packet broadcast channels
• Parallel graph algorithms based upon broadcast communications