25 citations · 44 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Hamming distance completeness and sparse matrix multiplication
Daniel Graf, Karim Labib, Przemysław Uznański
We show that a broad class of vector products (for binary integer functions ) are equivalent under one-to-polylog reductions to the computation of the Hamm…
cs.GT2017★ 8 cited
Truthful Mechanisms for Delivery with Mobile Agents
Andreas Bärtschi, Daniel Graf, Paolo Penna
We study the game-theoretic task of selecting mobile agents to deliver multiple items on a network. An instance is given by messages (physical objects) which have to be transpo…