Results 11 to 20 of about 3,836,696 (241)
Double hashing thresholds via local weak convergence [PDF]
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013 International audienceA lot of interest has recently arisen in the analysis of multiple-choice "cuckoo hashing" schemes. In this context, a main performance criterion is the load threshold under which the hashing scheme is able to build a valid hashtable
M. Leconte
exaly +11 more sources
The Analysis of Double Hashing [PDF]
Journal of Computer and System Sciences, 1978 In this paper we analyze the performance of double hashing, a well-known hashing algorithm in which we probe the hash table along arithmetic progressions where the initial element and the increment of the progression are chosen randomly and independently
L. Guibas, E. Szemerédi
semanticscholar +5 more sources
Double-Bit Quantization for Hashing
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost.
Kong, Weihao, Li, Wu-Jun
core +3 more sources
Balanced allocations and double hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2012 With double hashing, for an item x, one generates two hash values f(x) and g(x), and then uses combinations (f(x) +ig(x)) mod n for i=0,1,2,... to generate multiple hash values from the initial two.
M. Mitzenmacher
semanticscholar +6 more sources
Information Processing Letters, 2005 Double hashing with bucket capacity one is augmented with multiple passbits to obtain significant reduction to unsuccessful search lengths.
Walter A Burkhard
core +3 more sources
More Analysis of Double Hashing for Balanced Allocations [PDF]
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2015 With double hashing, for a key $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +i g(x)) \bmod n$ for $i=0,1,2,...$ to generate multiple hash values in the range $[0,n-1]$ from the initial two.
M. Mitzenmacher
semanticscholar +6 more sources
Double hashing technique in closed hashing search process
IOP Conference Series: Materials Science and Engineering, 2017 The search process is used in various activities performed both online and offline, many algorithms that can be used to perform the search process one of which is a hash search algorithm, search process with hash search algorithm used in this study using
R. Rahim, I. Zulkarnain, H. Jaya
semanticscholar +2 more sources
More analysis of double hashing
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988 In [GS78] a deep and elegant analysis showed that double hashing was equivalent to the ideal uniform hashing up to a load factor of about 0.319. In this paper we give an analysis which extends this to load factors arbitrarily close to 1.
G. S. Lueker, M. Molodowitch
semanticscholar +4 more sources
Quantum Collision Resistance of Double-Block-Length Hashing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesSUMMARY In 2005, Nandi introduced a class of double-block-length compression functions h π ( x ) : = ( h ( x ) , h ( π ( x ))) , where h is a random oraclewithan n -bitoutputand π isanon-cryptographicpublicpermutation.
Shoichi Hirose, H. Kuwakado
semanticscholar +2 more sources
The analysis of double hashing(Extended Abstract)
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976 In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen ...
L. J. Guibas, E. Szemerédi
semanticscholar +2 more sources