Time vs bits
From MaRDI portal
Publication:5096162
DOI10.1007/BFb0028992zbMath1492.68036OpenAlexW1853702128MaRDI QIDQ5096162
Nicola Santoro, Mark H. Overmars
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
Distributed systems (68M14) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)
Related Items
Cites Work
- New protocols for the election of a leader in a ring
- Lower Bounds for Distributed Maximum-Finding Algorithms
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Time vs bits