Pages that link to "Item:Q391396"

The following pages link to On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396):

Displaying 7 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)
• Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
• About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
• Randomness vs. time in anonymous networks (Q1664141) (← links)
• A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring (Q3977297) (← links)
• Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings (Q4339006) (← links)