A trade-off between collision probability and key size in universal hashing using polynomials (Q2430412): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MMH / rank | |||
Normal rank | |||
Revision as of 04:08, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A trade-off between collision probability and key size in universal hashing using polynomials |
scientific article |
Statements
A trade-off between collision probability and key size in universal hashing using polynomials (English)
0 references
6 April 2011
0 references
universal hash function
0 references
polynomial-based hashing
0 references
