11 citations · 23 across the 16 of their papers we have counts for
19 papers
Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents
Kass Bileski, Avery Miller
We consider a team of synchronous mobile agents operating in a port-labeled network. There is one node in the network, called a black hole, that permanently destroys any agent that…
Reconfiguration of Multisets with Applications to Bin Packing
Jeffrey Kam, Shahin Kamali, Avery Miller +1
We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of items could correspond to the fil…
Fast Deterministic Rendezvous in Labeled Lines
Avery Miller, Andrzej Pelc
Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as…
Cops and Robbers on 1-Planar Graphs
Stephane Durocher, Shahin Kamali, Myroslav Kryven +6
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and robber move along edges of G. The cop number of…
Labeling Schemes for Deterministic Radio Multi-Broadcast
Colin Krisko, Avery Miller
We consider the multi-broadcast problem in arbitrary connected radio networks consisting of nodes. There are designated source nodes for some fixed ,…
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,…