Since 2014
Linear Hashing
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Linear Hashing
|
|
| Creator |
Alon, Noga
Dietzfelbinger, Martin Miltersen, Peter Bro Petrank, Erez Tardos, Gábor |
|
| Description |
Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good H is as a class of hash functions, namely we consider hashing a set S of sizen into a range having the same cardinality n by a randomly chosen function from H and look at the expected size of the largest hash bucket. H is a universal class of hash functions for any finite field, butwith respect to our measure different fields behave differently.
|
|
| Publisher |
Aarhus University
|
|
| Date |
1997-01-16
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/18808
10.7146/brics.v4i16.18808 |
|
| Source |
BRICS Report Series; No 16 (1997): RS-16 Linear Hashing
BRICS Report Series; Nr. 16 (1997): RS-16 Linear Hashing 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/18808/16453
|
|