Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

DOI10.1145/1993806.1993849zbMath1321.68048OpenAlexW2090633038MaRDI QIDQ2943400

Mark R. Tuttle, Yoram Moses, Maurice P. Herlihy

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993806.1993849

zbMATH Keywords

topologycommon knowledgeconsensusrenamingsynchronous message passing modelcondition-based consensuscrash failure model

Mathematics Subject Classification ID

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

Related Items (3)

Unbeatable consensus ⋮ On the bit security of cryptographic primitives ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation

This page was built for publication: Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions