What Do We Need to Know to Elect in Networks with Unknown Participants?

DOI10.1007/978-3-319-09620-9_22zbMath1416.68022OpenAlexW591394241MaRDI QIDQ5496165

Jérémie Chalopin, Antoine Naudin, Emmanuel Godard

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_22

zbMATH Keywords

message passingdistributed algorithmleader electiondistributed computabilitystructural knowledgeunknown participants

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

This page was built for publication: What Do We Need to Know to Elect in Networks with Unknown Participants?