The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
From MaRDI portal
Publication:1314268
DOI10.1006/inco.1994.1002zbMath0801.68076WikidataQ59567999 ScholiaQ59567999MaRDI QIDQ1314268
Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
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
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68W15: Distributed algorithms
Related Items
