DocumentCode :
2177776
Title :
The analysis of hashing algorithms that exhibit k-ary clustering
Author :
Guibas, Leo J.
fYear :
1976
fDate :
25-27 Oct. 1976
Firstpage :
183
Lastpage :
196
Abstract :
In this paper we investigate the performance of hashing algorithms that begin the search into the table with k independent random probes.
Keywords :
Algorithm design and analysis; Clustering algorithms; Cost function; Measurement; Performance analysis; Probes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1976., 17th Annual Symposium on
Conference_Location :
Houston, TX, USA
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1976.31
Filename :
4567903
Link To Document :
بازگشت