Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

DOI10.1007/978-3-642-02930-1_40zbMath1248.68091OpenAlexW1817560729MaRDI QIDQ5321679

Eric Ruppert, Rachid Guerraoui

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_40

Mathematics Subject Classification ID

Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Related Items

Population protocols with faulty interactions: the impact of a leader, Simple and fast approximate counting and leader election in populations, Data Collection in Population Protocols with Non-uniformly Random Scheduler, Unnamed Item, Computing in social networks, Effective storage capacity of labeled graphs, Population protocols with unreliable communication, Terminating distributed construction of shapes and patterns in a fair solution of automata, The computational power of simple protocols for self-awareness on graphs, Fault tolerant network constructors, On space complexity of self-stabilizing leader election in mediated population protocol, Protocols with constant local storage and unreliable communication, Passively mobile communicating machines that use restricted space, Computational models for networks of tiny artifacts: a survey, Fault-tolerant simulation of population protocols, Mediated population protocols, Homonym population protocols, Simple and efficient local codes for distributed stable network construction, Data collection in population protocols with non-uniformly random scheduler, Clocked population protocols, Space-efficient self-stabilizing counting population protocols on mobile sensor networks, How many cooks spoil the soup?, A Survey on Analog Models of Computation