Pages that link to "Item:Q391647"

The following pages link to Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647):

Displaying 4 items.

• Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
• Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
• Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
• Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings (Q4339006) (← links)