Computing on a partially eponymous ring

DOI10.1016/j.tcs.2008.10.010zbMath1157.68028OpenAlexW2011137178MaRDI QIDQ1004322

Loizos Michael, Marios Mavronicolas, Paul 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

ringsolvabilitycomputabilitydistributed computationmessage complexitycircularly symmetric relationmultiple leader electionpartially eponymous

Mathematics Subject Classification ID

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

Related Items (2)

The space complexity of unbounded timestamps ⋮ Election in partially anonymous networks with arbitrary knowledge in message passing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Finite common coverings of graphs
• Sorting and election in anonymous asynchronous rings.
• Groupings and Pairings in Anonymous Networks
• Computing on an anonymous ring
• Decentralized extrema-finding in circular configurations of processors
• Computing functions on asynchronous anonymous networks
• Fibrations of graphs

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