1. A tail bound for read‐k families of functions1. Issue 1 (6th March 2014) Authors: Gavinsky, Dmitry; Lovett, Shachar; Saks, Michael; Srinivasan, Srikanth Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 99 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗