%0 Journal Article %1 journals/rsa/Feige95 %A Feige, Uriel %D 1995 %J Random Struct. Algorithms %K dblp %N 1 %P 51-54 %T A Tight Upper Bound on the Cover Time for Random Walks on Graphs. %U http://dblp.uni-trier.de/db/journals/rsa/rsa6.html#Feige95 %V 6

@article{journals/rsa/Feige95, added-at = {2012-04-14T00:00:00.000+0200}, author = {Feige, Uriel}, biburl = {https://www.bibsonomy.org/bibtex/2e0492382d2be98eb355de91ae6433bc2/dblp}, ee = {http://dx.doi.org/10.1002/rsa.3240060106}, interhash = {2f7a5dcdb82a252a073e4078264bbac1}, intrahash = {e0492382d2be98eb355de91ae6433bc2}, journal = {Random Struct. Algorithms}, keywords = {dblp}, number = 1, pages = {51-54}, timestamp = {2012-04-17T11:49:35.000+0200}, title = {A Tight Upper Bound on the Cover Time for Random Walks on Graphs.}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa6.html#Feige95}, volume = 6, year = 1995 }