@InProceedings{narayanan:LIPIcs.APPROX-RANDOM.2019.63,
author = {Narayanan, Shyam},
title = {{Pairwise Independent Random Walks Can Be Slightly Unbounded}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {63:1--63:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.63},
URN = {urn:nbn:de:0030-drops-112787},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.63},
annote = {Keywords: k-wise Independence, Random Walks, Moments, Chaining}
}