Analysis of closed hashing under limited randomness

Jeanette P. Schmidt, Alan Siegel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby establish the first proof of optimality for hashing arbitrarily selected data, by virtually any classical closed scheme, with hash functions that are programmable and initialized by a small number of random bits.

Original languageEnglish (US)
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Pages224-234
Number of pages11
ISBN (Print)0897913612
StatePublished - Jan 1 1990
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: May 14 1990May 16 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput

Other

OtherProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA
Period5/14/905/16/90

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Schmidt, J. P., & Siegel, A. (1990). Analysis of closed hashing under limited randomness. In Proc 22nd Annu ACM Symp Theory Comput (pp. 224-234). (Proc 22nd Annu ACM Symp Theory Comput). Publ by ACM.