Pages that link to "Item:Q3408183"
From MaRDI portal
The following pages link to An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183):
Displayed 4 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)