The following pages link to Kyrill Winkler (Q1713899):
Displaying 11 items.
- On the strongest message adversary for consensus in directed dynamic networks (Q1713900) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- Valency-based consensus under message adversaries without limit-closure (Q2140525) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- Topological Characterization of Consensus under General Message Adversaries (Q5145210) (← links)
- (Q5207884) (← links)
- (Q5874248) (← links)
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus (Q6536339) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6610374) (← links)