Pages that link to "Item:Q3210138"
From MaRDI portal
The following pages link to Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138):
Displaying 13 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Distributed election in complete networks (Q1112606) (← links)
- On a game in directed graphs. (Q1853026) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014) (← links)
- Design and analysis of dynamic leader election protocols in broadcast networks (Q5137017) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- Communication efficient self-stabilizing leader election (Q6535008) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
