@InProceedings{guinard_et_al:LIPIcs.STACS.2020.28,
author = {Guinard, Brieuc and Korman, Amos},
title = {{Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths}},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-140-5},
ISSN = {1868-8969},
year = {2020},
volume = {154},
editor = {Paul, Christophe and Bl\"{a}ser, Markus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.28},
URN = {urn:nbn:de:0030-drops-118892},
doi = {10.4230/LIPIcs.STACS.2020.28},
annote = {Keywords: Computational Biology, Randomness in Computing, Search Algorithms, Random Walks, L\'{e}vy Flights, Intermittent Search, CCRW}
}