11 citations · 23 across the 16 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DC2020
Four Shades of Deterministic Leader Election in Anonymous Networks
Barun Gorain, Avery Miller, Andrzej Pelc
Leader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way,…
cs.DC2020
Fast Byzantine Gathering with Visibility in Graphs
Avery Miller, Ullash Saha
We consider the gathering task by a team of synchronous mobile robots in a graph of nodes. Each robot has an identifier (ID) and runs its own deterministic algorithm, i.e.,…
cs.DC2020
Deterministic Leader Election in Anonymous Radio Networks
Avery Miller, Andrzej Pelc, Ram Narayan Yadav
We consider leader election in anonymous radio networks modeled as simple undirected connected graphs. Nodes communicate in synchronous rounds. Nodes are anonymous and execute the…