Election in partially anonymous networks with arbitrary knowledge in message passing systems

DOI10.1007/s00446-012-0163-yzbMath1429.68330OpenAlexW2118545058MaRDI QIDQ1938371

Emmanuel Godard, Jérémie Chalopin, Yves Métivier

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0163-y

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Snap-stabilizing tasks in anonymous networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed enumeration
• On the power of synchronization between two adjacent processes
• Computing on a partially eponymous ring
• Solvability of the asynchronous ranking problem
• Characterizations of classes of graphs recognizable by local computations
• Design and Analysis of Distributed Algorithms
• Synchronized Distributed Termination
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Introduction to Distributed Algorithms
• Fibrations of graphs

This page was built for publication: Election in partially anonymous networks with arbitrary knowledge in message passing systems