Linear Hashing

Forfattere

  • Noga Alon
  • Martin Dietzfelbinger
  • Peter Bro Miltersen
  • Erez Petrank
  • Gábor Tardos

DOI:

https://doi.org/10.7146/brics.v4i16.18808

Resumé

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 size
n 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, but
with respect to our measure different fields behave differently.

Downloads

Publiceret

1997-01-16

Citation/Eksport

Alon, N., Dietzfelbinger, M., Miltersen, P. B., Petrank, E., & Tardos, G. (1997). Linear Hashing. BRICS Report Series, 4(16). https://doi.org/10.7146/brics.v4i16.18808

Nummer

Nr. 16 (1997): RS-16 Linear Hashing

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).