3 papers
cs.DC2026
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)…
math.CO2026
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…
cs.LG2025
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…