47 citations · 107 across the 20 of their papers we have counts for
1 paper · 1 filter
Mika Göös, Juho Hirvonen, Jukka Suomela
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique O(logn)-bit identifier. We prove that for a general class of graph probl…