1 citations · 1 across the 5 of their papers we have counts for
5 papers
Fast Gossip-based Rumor Spreading using Small Messages
Fabien Dufoulon, William K. Moses, Gopal Pandurangan
We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown)…
Broadcasting Agents and Adversary: A new variation on Cops and Robbers
William K. Moses, Amanda Redlich, Frederick Stock
We introduce a new game played on graphs, ``Agents and Adversary". This game is reminiscent of ``Cops and Robbers" but has some fundamental differences. We classify infinite famili…
Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
Kunanon Burathep, Thomas Erlebach, William K. Moses
We study the online unweighted bipartite matching problem in the random arrival order model, with offline and online vertices, in the learning-augmented setting: The algori…
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer +2
Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a…
Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
William K. Moses, Amanda Redlich
In this paper, we look at and expand the problems of dispersion and Byzantine dispersion of mobile robots on a graph, introduced by Augustine and Moses~Jr.~[ICDCN~2018] and by Moll…