TY - JOUR
T1 - The tree model for hashing
T2 - Lower and upper bounds
AU - Gil, Joseph
AU - Meyer Auf Der Heide, Friedhelm
AU - Wigderson, Avi
PY - 1996/10
Y1 - 1996/10
N2 - We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key.
AB - We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key.
KW - Parallel algorithms
KW - Randomization data structures
UR - http://www.scopus.com/inward/record.url?scp=4243133862&partnerID=8YFLogxK
U2 - 10.1137/S0097539793255722
DO - 10.1137/S0097539793255722
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:4243133862
SN - 0097-5397
VL - 25
SP - 936
EP - 955
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 5
ER -