Linear Hash Functions (1999)
Cached
Download Links
- [www.cs.berkeley.edu]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.brics.dk]
- [www.daimi.au.dk]
- DBLP
Other Repositories/Bibliography
by
Noga Alon
,
Martin Dietzfelbinger
,
Peter Bro Miltersen
,
Erez Petrank
,
Gábor Tardos
| Citations: | 7 - 0 self |
BibTeX
@MISC{Alon99linearhash,
author = {Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and Gábor Tardos},
title = {Linear Hash Functions},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Consider the set # of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good # is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from # and look at the expected size of the largest hash bucket. # is a universal class of hash functions for any finite field, but with respect to our measure different fields behave differently. If the
