On the Complexity of Universal Leader Election
From MaRDI portal
Recommendations
- On the complexity of universal leader election
- Singularly optimal randomized leader election
- The complexity of leader election in diameter-two networks
- Simple and efficient leader election in the full information model
- Leader election in complete networks
- Leader Election in Complete Networks
- On space and time complexity of loosely-stabilizing leader election
- Asymptotic properties of a leader election algorithm
- A probabilistic analysis of a leader election algorithm
- Exponential separations in the energy complexity of leader election
Cites work
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A trade-off between information and communication in broadcast protocols
- Design and Analysis of Distributed Algorithms
- Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
- Distributed Computing: A Locality-Sensitive Approach
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Electing a leader in a synchronous ring
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Probability and Computing
- Size-estimation framework with applications to transitive closure and reachability
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
Cited in
(33)- Deterministic leader election in O(D+ n) time with messages of size O(1)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Randomized leader election
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- The complexity of leader election in diameter-two networks
- Near-optimal knowledge-free resilient leader election
- Latency, capacity, and distributed minimum spanning trees
- Message lower bounds via efficient network synchronization
- Leader election in well-connected graphs
- How to elect a leader faster than a tournament
- Message Lower Bounds via Efficient Network Synchronization
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Distributed MST and broadcast with fewer messages, and faster gossiping
- Time-message trade-offs in distributed algorithms
- Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
- On the complexity of universal leader election
- Leader election in well-connected graphs
- Sublinear message bounds for randomized agreement
- Communication costs in a geometric communication network
- Improved deterministic leader election in diameter-two networks
- Transmitting once to elect a leader on wireless networks
- Distributed computation of exact average degree and network size in finite time under quantized communication
- Termination of amnesiac flooding
- Improved Tradeoffs for Leader Election
- Smoothed Analysis of Leader Election in Distributed Networks
- Singularly optimal randomized leader election
- The topology of randomized symmetry-breaking distributed computing
- Faster leader election via mobile agents and its applications
- Time- and communication-efficient overlay network construction via gossip
- The message complexity of distributed graph optimization
- Near-optimal leader election in population protocols on graphs
- Tight bounds on the message complexity of distributed tree verification
- What is the minimum number of random bits required for computabilityokula and efficiency in anonymous networks?
This page was built for publication: On the Complexity of Universal Leader Election
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501952)
