scientific article; zbMATH DE number 17531

zbMATH Open0756.68015MaRDI QIDQ3974855FDOQ3974855

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

Publication date 26 June 1992

zbMATH Keywords

lower bounddistributed message complexitydistributed network of processors

Mathematics Subject Classification ID

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

Recommendations

• The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• Better computing on the anonymous ring
• Gap Theorems for Distributed Computation
• Language complexity on the synchronous anonymous ring

Cited in

(6)

• Computing on an anonymous ring
• On the bit complexity of distributed computations in a ring with a leader
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• Message terminating algorithms for anonymous rings of unknown size
• Gap Theorems for Distributed Computation
• scientific article; zbMATH DE number 177819 (Why is no real title available?)

This page was built for publication:

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