Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

DOI10.1007/978-3-642-02930-1_40zbMath1248.68091MaRDI 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

68M14: Distributed systems

68T42: Agent technology and artificial intelligence

Related Items

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