Mediated Population Protocols: Leader Election and Applications

DOI10.1007/978-3-319-55911-7_13zbMath1485.68018OpenAlexW2600576745MaRDI QIDQ2988820

Shantanu Das, Paola Flocchini, Giovanni Viglietta, Nicola Santoro, Giuseppe Antonio Di Luna

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (4)

Population protocols with faulty interactions: the impact of a leader ⋮ Simple and fast approximate counting and leader election in populations ⋮ Unnamed Item ⋮ Fault-tolerant simulation of population protocols

Cites Work

• Mediated population protocols
• A self-stabilizing transformer for population protocols with covering
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Population protocols with faulty interactions: the impact of a leader
• Space-optimal counting in population protocols
• On space complexity of self-stabilizing leader election in mediated population protocol
• Computation in networks of passively mobile finite-state sensors
• Fast and Exact Majority in Population Protocols
• Stably computable predicates are semilinear
• Unnamed Item

This page was built for publication: Mediated Population Protocols: Leader Election and Applications