35 citations · 114 across the 25 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015★ 1 cited
On Percolation and -Hardness
Daniel Reichman, Igor Shinkar
We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical -h…
cs.GT2015★ 2 cited
On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players
Joseph Y. Halpern, Rafael Pass, Daniel Reichman
We consider sequences of games where, for all , has the same set of players. Such sequences arise in the analysis of running time of playe…
cs.DM2015
Contagious Sets in Dense Graphs
Daniel Freund, Matthias Poloczek, Daniel Reichman
We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some…