Pages that link to "Item:Q658666"
From MaRDI portal
The following pages link to An optimal bit complexity randomized distributed MIS algorithm (Q658666):
Displaying 12 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
