11 citations · 23 across the 16 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DC2014★ 4 cited
Election vs. Selection: Two Ways of Finding the Largest Node in a Graph
Avery Miller, Andrzej Pelc
Finding the node with the largest label in a network, modeled as an undirected connected graph, is one of the fundamental problems in distributed computing. This is the way in whic…
cs.DS2014★ 5 cited
Fast Rendezvous with Advice
Avery Miller, Andrzej Pelc
Two mobile agents, starting from different nodes of an -node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move…