1 citations · 1 across the 6 of their papers we have counts for
9 papers
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,…
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.,…
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…
Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs
Shahin Kamali, Avery Miller, Kenny Zhang
Graph burning is a simple model for the spread of social influence in networks. The objective is to measure how quickly a fire (e.g., a piece of fake news) can be spread in a netwo…
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
Avery Miller, Boaz Patt-Shamir, Will Rosenbaum
We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate and burstiness . In this model, we analyze th…
Buffer Size for Routing Limited-Rate Adversarial Traffic
Avery Miller, Boaz Patt-Shamir
We consider the slight variation of the adversarial queuing theory model, in which an adversary injects packets with routes into the network subject to the following constraint: Fo…