Learning a ring cheaply and fast

DOI10.1007/978-3-642-39212-2_49MaRDI QIDQ5327465zbMATH OpenOpenAlexFDO

Authors Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39212-2_49

zbMATH Keywords

labeled ringmessage complexitytradeoff

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Recommendations

• Distributed Colouring and Communication in Rings with Local Knowledge
• Optimal tradeoffs between time and bit complexity in distributed synchronous rings
• On the time and the bit complexity of distributed randomised anonymous ring colouring
• Computing on an anonymous ring
• Better computing on the anonymous ring

Cited in

(2)

• Auslander-Gorenstein rings for beginners
• Distributed Colouring and Communication in Rings with Local Knowledge

This page was built for publication: Learning a ring cheaply and fast

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