Pages that link to "Item:Q3768383"
From MaRDI portal
The following pages link to Electing a leader in a synchronous ring (Q3768383):
Displaying 39 items.
- Anonymous meeting in networks (Q262278) (← links)
- The bit complexity of the predecessor problem (Q287147) (← links)
- Computing with infinitely many processes (Q391645) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Strong order-preserving renaming in the synchronous message passing model (Q708233) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- Bit-optimal election in synchronous rings (Q916342) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- Wait-free implementations in message-passing systems (Q1292433) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Improved bounds for electing a leader in a synchronous ring (Q1355728) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Randomized leader election (Q1954216) (← links)
- Renaming in synchronous message passing systems with Byzantine failures (Q1954260) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Distributed communication complexity of spanning tree construction (Q2355664) (← links)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- An improved election algorithm in chordal ring networks (Q3991122) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- (Q5090892) (← links)
- Distance-Preserving Subgraphs of Interval Graphs (Q5111726) (← links)
- On the complexity of global computation in the presence of link failures: the general case (Q5136985) (← links)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
