scientific article; zbMATH DE number 7053299
From MaRDI portal
Publication:5743420
zbMath1422.68007MaRDI QIDQ5743420
Peter Robinson, Eli Upfal, Gopal Pandurangan, John E. Augustine
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095163
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomized algorithmdistributed algorithmdynamic networkpeer-to-peer networkexpander graphstable agreement
Network design and communication in computer systems (68M10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (11)
DEX: self-healing expanders ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Expansion and flooding in dynamic random networks with node churn ⋮ The complexity of growing a graph ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Poly onions: achieving anonymity in the presence of churn ⋮ Bankrupting Sybil despite churn ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Leader Election in Sparse Dynamic Networks with Churn ⋮ Distributed computation in dynamic networks via random walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a scalable and robust DHT
- The effect of faults on network expansion
- Fast consensus in networks of bounded degree.
- Tolerating a linear number of faults in networks of bounded degree
- Size-estimation framework with applications to transitive closure and reachability
- Towards worst-case churn resistant peer-to-peer systems
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
- Distributed computation in dynamic networks
- Fast asynchronous Byzantine agreement and leader election with full information
- Coordinated consensus in dynamic networks
- Xheal
- Faster information dissemination in dynamic networks via network coding
- The Complexity of Data Aggregation in Directed Networks
- How to spread adversarial nodes?
- Scalable leader election
- Fast Distributed Algorithms for Computing Separable Functions
- Fault Tolerance in Networks of Bounded Degree
- Network information flow
- Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
- Parsimonious flooding in dynamic graphs
- Partial information spreading with application to distributed maximum coverage
- A Distributed and Oblivious Heap
- The slide mechanism with applications in dynamic networks
- Breaking the O ( n 2 ) bit barrier
- Analyzing network coding gossip made easy
- Distributed Computing
This page was built for publication:
