The following pages link to Peter Robinson (Q477101):
Displaying 24 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Fast Byzantine leader election in dynamic networks (Q1664142) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- DEX: self-healing expanders (Q2629213) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061) (← links)
- Fast byzantine agreement in dynamic networks (Q5176084) (← links)
- On the complexity of universal leader election (Q5176087) (← links)
- Leader Election in Well-Connected Graphs (Q5197688) (← links)
- (Q5203926) (← links)
- Efficient Computation of Balanced Structures (Q5327467) (← links)
- Distributed Computation of Large-scale Graph Problems (Q5362982) (← links)
- Brief Announcement (Q5368965) (← links)
- Brief Announcement (Q5368972) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- (Q5743420) (← links)
- DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead (Q5855269) (← links)
- Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets (Q6487514) (← links)
- The complexity of symmetry breaking in massive graphs (Q6487543) (← links)
