Cite
HARVARD Citation
Gavinsky, D. et al. (2015). A tail bound for read‐k families of functions1. Random structures & algorithms. 47 (1), pp. 99-108. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Gavinsky, D. et al. (2015). A tail bound for read‐k families of functions1. Random structures & algorithms. 47 (1), pp. 99-108. [Online].