Computing on a partially eponymous ring
type: Item
instance of: scholarly article
title: Computing on a partially eponymous ring
zbMATH Open document ID: 1157.68028
author: Marios Mavronicolas
author: Loizos Michael
author: P. G. Spirakis
published in: Theoretical Computer Science
publication date: 2009-03-02T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 5522269
zbMATH Keywords: distributed computation
zbMATH Keywords: partially eponymous
zbMATH Keywords: ring
zbMATH Keywords: solvability
zbMATH Keywords: computability
zbMATH Keywords: message complexity
zbMATH Keywords: multiple leader election
zbMATH Keywords: circularly symmetric relation
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.10.010
OpenAlex ID: W2011137178
cites work: Computing on an anonymous ring
cites work: Q4436038
cites work: Fibrations of graphs
cites work: Groupings and Pairings in Anonymous Networks
cites work: Q4825703
cites work: Sorting and election in anonymous asynchronous rings.
cites work: Decentralized extrema-finding in circular configurations of processors
cites work: Finite common coverings of graphs
cites work: Computing functions on asynchronous anonymous networks
DOI: 10.1016/J.TCS.2008.10.010
description: scientific article; zbMATH DE number 5522269