Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom low
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- Searchable symmetric encryption→Space/time trade-offs in hash coding with allowable errorsLegacy edge — source detail unavailable
- RAPPOR→Space/time trade-offs in hash coding with allowable errorsLegacy edge — source detail unavailable
- Conjunctive, Subset, and Range Queries on Encrypted Data→Space/time trade-offs in hash coding with allowable errorsLegacy edge — source detail unavailable
- Searchable symmetric encryption→Conjunctive, Subset, and Range Queries on Encrypted DataLegacy edge — source detail unavailable
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Searchable symmetric encryption | 2006 | 1,670 |
| RAPPOR | 2014 | 1,548 |
| Conjunctive, Subset, and Range Queries on Encrypted Data | 2007 | 1,453 |
Links
Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record
Topics
| Algorithms and Data Compression | Computer Science |
| Error Correcting Code Techniques | Computer Science |
| Advanced Image and Video Retrieval Techniques | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports5 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…