scientific article; zbMATH DE number 7561256
From MaRDI portal
Publication:5090892
Recommendations
- Algorithms for Leader Selection in Stochastically Forced Consensus Networks
- On the selection of leaders for the controllability of multi-agent networks
- Choosing a leader on a complex network
- Self-stabilizing leader election in dynamic networks
- Leader selection in networks under switching topologies with antagonistic interactions
- scientific article; zbMATH DE number 88976
- scientific article; zbMATH DE number 6313182
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Markov chain algorithm for compression in self-organizing particle systems
- Calling names on nameless networks
- Complexity of network synchronization
- Computation in networks of passively mobile finite-state sensors
- Computing on an anonymous ring
- Deploying wireless networks with beeps
- Distributed Computing: A Locality-Sensitive Approach
- Electing a leader in a synchronous ring
- Elections in anonymous networks
- Impossibility of distributed consensus with one faulty process
- Leader election and shape formation with self-organizing programmable matter
- Mediated population protocols
- Stone age distributed computing
- Symmetry breaking in distributed networks
- Timing in chemical reaction networks
- Weak models of distributed computing, with connections to modal logic
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090892)
