Self-stabilizing MIS computation in the beeping model
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7788511 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks
- A biological solution to a fundamental distributed computing problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- An Improved Distributed Algorithm for Maximal Independent Set
- Beeping a maximal independent set
- Deploying wireless networks with beeps
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Distributed Computing: A Locality-Sensitive Approach
- Distributed MIS via all-to-all communication
- Distributed Maximal Independent Set using Small Messages
- Distributed Self-Stabilizing MIS with Few States and Weak Communication
- Dynamic networks of finite state machines
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- Local distributed rounding: generalized to MIS, matching, set cover, and beyond
- Lower Bounds for Maximal Matchings and Maximal Independent Sets
- Luby's MIS algorithms made self-stabilizing
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Stone age distributed computing
- \textsc{Maximal Independent Sets} in radio networks
This page was built for publication: Self-stabilizing MIS computation in the beeping model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6853588)
