Time vs bits

DOI10.1007/BFB0028992MaRDI QIDQ5096162zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, N. Santoro

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

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

zbMATH Keywords

asynchronous systemcommunication complexityelection algorithmleader electionpartial synchrony

Mathematics Subject Classification ID

Distributed systems (68M14) Communication complexity, information complexity (68Q11) Distributed algorithms (68W15)

Cites work

• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• scientific article; zbMATH DE number 3967924 (Why is no real title available?)
• scientific article; zbMATH DE number 4049013 (Why is no real title available?)
• scientific article; zbMATH DE number 4050992 (Why is no real title available?)
• scientific article; zbMATH DE number 4068275 (Why is no real title available?)
• Lower Bounds for Distributed Maximum-Finding Algorithms
• New protocols for the election of a leader in a ring

Cited in

(2)

• Brief Announcement
• Bit-optimal election in synchronous rings

This page was built for publication: Time vs bits

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