Omer Reingold, Luca Trevisan, Salil P. Vadhan. Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electronic Colloquium on Computational Complexity (ECCC), (022), 2005. [doi]
@article{ECCC-TR05-022,
title = {Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem},
author = {Omer Reingold and Luca Trevisan and Salil P. Vadhan},
year = {2005},
url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-022/index.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ECCC-TR05-022},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {022},
}