Reingold, Trevisan, and Vadhan's breakthrough 2006 paper (http://dl.acm.org/citation.cfm?id=1132583) reduced the problem of showing $RL=L$ to producing pseudorandom walks on regular digraphs that are not consistently labeled.Has any further progress on this problem been made since then?
$RL=L$ Progress Since 2006
cc.complexity theory;reference request;pseudorandomness