Abstract
A key concept in the theory of distributed computing is locality: if I am a node in the middle of a large graph, how far do I need to see in order to pick my own part of the solution? A modern, effective technique for studying such questions is called round elimination.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have