Coordinated consensus in dynamic networks
From MaRDI portal
Publication:2943377
DOI10.1145/1993806.1993808zbMATH Open1321.68028OpenAlexW2135254481MaRDI QIDQ2943377FDOQ2943377
Authors: 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
Recommendations
- Consensus in rooted dynamic networks with short-lived stability
- A characterization of dynamic networks where consensus is solvable
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Tight Bounds for Asymptotic and Approximate Consensus
- Tight bounds for asymptotic and approximate consensus
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Flooding time in edge-Markovian dynamic graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Parsimonious flooding in dynamic graphs
- Distributed computation in dynamic networks
- Continuous consensus via common knowledge
- Reaching Agreement in the Presence of Faults
- Knowledge and common knowledge in a distributed environment
- Perfectly secure message transmission
- Programming simultaneous actions using common knowledge
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Consensus algorithms with one-bit messages
- Broadcasting in dynamic radio networks
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Fault Tolerance in Networks of Bounded Degree
- Optimal gradient clock synchronization in dynamic networks
- Almost-Everywhere Secure Computation
- Gradient clock synchronization in dynamic networks
Cited In (41)
- Distributed agreement in dynamic peer-to-peer networks
- A topological perspective on distributed network algorithms
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Gathering in dynamic rings
- On the expressivity of time-varying graphs
- Synchronization modulo \(P\) in dynamic networks
- Consensus formation in networks with neighbor-dependent synergy and observer effect
- Consensus Problems on Networks With Antagonistic Interactions
- The weakest failure detector for eventual consistency
- A characterization of dynamic networks where consensus is solvable
- Consensus in rooted dynamic networks with short-lived stability
- Enabling minimal dominating set in highly dynamic distributed systems
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Consensus and Coherence in Fractal Networks
- A characterization of oblivious message adversaries for which consensus is solvable
- Sublinear algorithms in \(T\)-interval dynamic networks
- Distributed exploration of dynamic rings
- Bounded-contention coding for the additive network model
- An introduction to temporal graphs: an algorithmic perspective
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Non-preemptive tree packing
- On the impact of link faults on Byzantine agreement
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
- Reset strategy for consensus in networks of clusters
- Exploration of dynamic networks: tight bounds on the number of agents
- Some lower bounds in dynamic networks with oblivious adversaries
- Overcoming the coordination problem: dynamic formation of networks
- Reaching consensus in ad-hoc diffusion networks
- On the radius of nonsplit graphs and information dissemination in dynamic networks
- Consensus Propagation
- Towards robust and efficient computation in dynamic peer-to-peer networks
- Round-Oblivious Stabilizing Consensus in Dynamic Networks
- A connectivity model for agreement in dynamic systems
- Fast consensus seeking on networks with antagonistic interactions
- Synchronization Modulo k in Dynamic Networks
- The time complexity of consensus under oblivious message adversaries
- Distributed computation in dynamic networks via random walks
- The firing squad problem revisited
- The firing squad problem revisited
- Blockchain in dynamic networks
- Models of smoothing in dynamic networks
This page was built for publication: Coordinated consensus in dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943377)
