Coordinated consensus in dynamic networks
From MaRDI portal
Publication:2943377
DOI10.1145/1993806.1993808zbMath1321.68028OpenAlexW2135254481MaRDI QIDQ2943377
Fabian Kuhn, Rotem Oshman, Yoram Moses
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.1993808
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Some lower bounds in dynamic networks with oblivious adversaries, Distributed exploration of dynamic rings, The Firing Squad Problem Revisited., Causality, influence, and computation in possibly disconnected synchronous dynamic networks, Blockchain in dynamic networks, Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks, On the impact of link faults on Byzantine agreement, Exploration of dynamic networks: tight bounds on the number of agents, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Consensus in rooted dynamic networks with short-lived stability, The weakest failure detector for eventual consistency, Smoothed analysis of dynamic networks, Gathering in dynamic rings, Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems, A topological perspective on distributed network algorithms, Non-preemptive tree packing, Bounded-contention coding for the additive network model, The firing squad problem revisited, An Introduction to Temporal Graphs: An Algorithmic Perspective*, Unnamed Item, Distributed computation in dynamic networks via random walks, A characterization of oblivious message adversaries for which consensus is solvable, A Characterization of Dynamic Networks Where Consensus Is Solvable, On the expressivity of time-varying graphs, Synchronization modulo \(P\) in dynamic networks, Distributed agreement in dynamic peer-to-peer networks
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
