A fast maximum finding algorithm on broadcast communication

DOI10.1016/S0020-0190(96)00143-3MaRDI QIDQ1350933zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1696641
• Reducing conflict resolution time for solving graph problems in broadcast communications
• A simple, efficient algorithm for maximum finding on rings
• scientific article; zbMATH DE number 3884101
• Conflict resolution in a multiple access channel

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Distributed selectsort sorting algorithms on broadcast communication networks
• Parallel graph algorithms based upon broadcast communications
• Reducing conflict resolution time for solving graph problems in broadcast communications
• Tree algorithms for packet broadcast channels

Cited in

(6)

• Sorting algorithms for broadcast communications: mathematical analysis.
• Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• A fast maximum finding algorithm on broadcast communication
• scientific article; zbMATH DE number 1696641 (Why is no real title available?)
• Reducing conflict resolution time for solving graph problems in broadcast communications

This page was built for publication: A fast maximum finding algorithm on broadcast communication

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