Sorting and election in anonymous asynchronous rings.
From MaRDI portal
Publication:1427459
DOI10.1016/j.jpdc.2003.11.007zbMath1069.68023WikidataQ57832146 ScholiaQ57832146MaRDI QIDQ1427459
Paola Flocchini, Evangelos Kranakis, Nicola Santoro, Flaminia L. Luccio, Danny Krizanc
Publication date: 14 March 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.11.007
68M14: Distributed systems
Related Items
Gathering in dynamic rings, Topology recognition and leader election in colored networks, Four shades of deterministic leader election in anonymous networks, Knowledge, level of symmetry, and time of leader election, How much memory is needed for leader election, Computing on a partially eponymous ring, Impact of knowledge on election time in anonymous networks, Leader election for anonymous asynchronous agents in arbitrary networks