The distributed bit complexity of the ring: From the anonymous to the non-anonymous case

DOI10.1006/INCO.1994.1002zbMath0801.68076DBLPjournals/iandc/BodlaenderMW94OpenAlexW2125685395WikidataQ59567999 ScholiaQ59567999MaRDI QIDQ1314268

Shlomo Moran, Manfred K. Warmuth, Hans L. Bodlaender

Publication date: 22 February 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16584

zbMATH Keywords

distributed bit complexity

Mathematics Subject Classification ID

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

Related Items (8)

On the time and the bit complexity of distributed randomised anonymous ring colouring ⋮ Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings ⋮ Hundreds of impossibility results for distributed computing ⋮ An optimal bit complexity randomized distributed MIS algorithm ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ About randomised distributed graph colouring and graph partition algorithms ⋮ An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

This page was built for publication: The distributed bit complexity of the ring: From the anonymous to the non-anonymous case