Sorting and election in anonymous asynchronous rings.

DOI10.1016/J.JPDC.2003.11.007MaRDI QIDQ1427459zbMATH OpenOpenAlexWikidataFDO

Authors P. Flocchini, Evangelos Kranakis, D. Krizanc, Flaminia L. Luccio, N. Santoro

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

Anonymous ringDistributed computingLeader electionMultisetsSorting

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Electing a leader in a synchronous ring
• scientific article; zbMATH DE number 2113969
• Better computing on the anonymous ring
• Computing on an anonymous ring
• scientific article; zbMATH DE number 177572

Cited in

(10)

• Computing on a partially eponymous ring
• Impact of knowledge on election time in anonymous networks
• Leader election for anonymous asynchronous agents in arbitrary networks
• Gathering in dynamic rings
• Topology recognition and leader election in colored networks
• Four shades of deterministic leader election in anonymous networks
• How much memory is needed for leader election
• Brief announcement: Content-oblivious leader election on rings
• Content-oblivious leader election on rings
• Bit-optimal election in synchronous rings

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

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