A fast maximum finding algorithm on broadcast communication

DOI10.1007/bfb0030868zbMath1527.68020OpenAlexW1507024523MaRDI QIDQ6085743

Shyue-Horng Shiau, Chang-Biau Yang

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030868

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

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
• Dynamic prioritized conflict resolution on multiple access broadcast networks
• Parallel graph algorithms based upon broadcast communications

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