The following pages link to Beeping a maximal independent set (Q2441534):
Displaying 23 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Noisy rumor spreading and plurality consensus (Q2318110) (← links)
- The ANTS problem (Q2401118) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- (Q3095314) (redirect page) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- (Q5090892) (← links)
- (Q5090911) (← links)
- The Synergy of Finite State Machines (Q5091099) (← links)
- Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)
