Computing on a partially eponymous ring

DOI10.1016/J.TCS.2008.10.010MaRDI QIDQ1004322zbMATH OpenOpenAlexFDO

Authors Marios Mavronicolas, Loizos Michael, P. G. Spirakis

Publication date 2 March 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.10.010

zbMATH Keywords

circularly symmetric relationcomputabilitydistributed computationmessage complexitymultiple leader electionpartially eponymousringsolvability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Computing on an anonymous ring
• Better computing on the anonymous ring
• The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
• Computing functions on asynchronous anonymous networks
• Gap Theorems for Distributed Computation

Cites work

• Computing functions on asynchronous anonymous networks
• Computing on an anonymous ring
• Decentralized extrema-finding in circular configurations of processors
• Fibrations of graphs
• Finite common coverings of graphs
• Groupings and Pairings in Anonymous Networks
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• scientific article; zbMATH DE number 2113969 (Why is no real title available?)
• Sorting and election in anonymous asynchronous rings.

Cited in

(4)

• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• The space complexity of unbounded timestamps
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• scientific article; zbMATH DE number 1859714 (Why is no real title available?)

This page was built for publication: Computing on a partially eponymous ring

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