49 citations · 49 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2025
Existence of Deadlock-Free Routing for Arbitrary Networks
Uri Mendlovic, Yossi Matias
Given a network of routing nodes, represented as a directed graph, we prove the following necessary and sufficient condition for the existence of deadlock-free message routing: The…
math.CO2024
The Prisoners and the Swap: Less than Half is Enough
Uri Mendlovic
We improve the solution of the classical prisoners and drawers riddle, where all prisoners can find their number using the pointer-following strategy, provided that the prisoners c…