Effective Elections for Anonymous Mobile Agents

DOI10.1007/11940128_73zbMath1135.68338OpenAlexW1575360748MaRDI QIDQ5459167

Amiya Nayak, Shantanu Das, Nicola Santoro, Paola Flocchini

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_73

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (5)

Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Move-optimal gossiping among mobile agents ⋮ COMBINING GENETIC PROGRAMMING AND MODEL-DRIVEN DEVELOPMENT ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Distinguishing views in symmetric networks: a tight lower bound

This page was built for publication: Effective Elections for Anonymous Mobile Agents