"A tail bound for read-k families of functions."

Dmitry Gavinsky et al. (2015)

> Home

Details and statistics

DOI: 10.1002/RSA.20532

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/GavinskyLSS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GavinskyLSS15
Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A tail bound for read-k families of functions. Random Struct. Algorithms 47(1): 99-108 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.