4 citations · 19 across the 11 of their papers we have counts for
1 paper · 1 filter
Dimitris Achlioptas, Fotis Iliopoulos
We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly. Our work is inspired by Moser's e…