1. Speeding up cover time of sparse graphs using local knowledge;Abdullah,2015
2. Parallel rotor walks on finite graphs and applications in discrete load balancing;Akbari,2013
3. Strong uniform times and finite random walks;Aldous;Adv. Appl. Math.,1987
4. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
5. Many random walks are faster than one;Alon;Comb. Probab. Comput.,2011