Request file

Review/Citation:  GAVINSKY, Dmitry, LOVETT, S., SAKS, M., SRINIVASAN, S. A tail bound for read-k families of functions. Random Structures and Algorithms. 2015, 47(1), 99-108. ISSN 1042-9832. E-ISSN 1098-2418
Requested document:  Gavinsky.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.