Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan. A Tail Bound for Read-k Families of Functions. Electronic Colloquium on Computational Complexity (ECCC), 19:51, 2012. [doi]
@article{GavinskyLSS12,
title = {A Tail Bound for Read-k Families of Functions},
author = {Dmitry Gavinsky and Shachar Lovett and Michael E. Saks and Srikanth Srinivasan},
year = {2012},
url = {http://eccc.hpi-web.de/report/2012/051},
researchr = {https://researchr.org/publication/GavinskyLSS12},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
pages = {51},
}