Sorting and election in anonymous asynchronous rings.

DOI10.1016/j.jpdc.2003.11.007zbMath1069.68023OpenAlexW2066431556WikidataQ57832146 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

zbMATH Keywords

Distributed computingLeader electionSortingAnonymous ringMultisets

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (8)

Four shades of deterministic leader election in anonymous networks ⋮ How much memory is needed for leader election ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Impact of knowledge on election time in anonymous networks ⋮ Gathering in dynamic rings ⋮ Topology recognition and leader election in colored networks ⋮ Computing on a partially eponymous ring

This page was built for publication: Sorting and election in anonymous asynchronous rings.