Results 1 to 10 of about 2,163,207 (263)
More Analysis of Double Hashing for Balanced Allocations [PDF]
arXiv, 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. For balanced allocations, keys are hashed into a hash table where each bucket can hold multiple keys, and each key is ...
Michael Mitzenmacher
arxiv +11 more sources
Balanced allocations and double hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014 Further updated, small improvements/typos ...
Michael Mitzenmacher
semanticscholar +6 more sources
Double-Hashing Algorithm for Frequency Estimation in Data Streams [PDF]
arXiv, 2022 Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage.
Nikita Seleznev +2 more
arxiv +7 more sources
Model Size Reduction Using Frequency Based Double Hashing for Recommender Systems [PDF]
arXiv, 2020 Deep Neural Networks (DNNs) with sparse input features have been widely used in recommender systems in industry. These models have large memory requirements and need a huge amount of training data. The large model size usually entails a cost, in the range of millions of dollars, for storage and communication with the inference services.
Caojin Zhang +12 more
arxiv +7 more sources
Complexity analysis and performance of double hashing sort algorithm [PDF]
Journal of the Egyptian Mathematical Society, 2019 Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics.
Hazem M. Bahig
doaj +4 more sources
Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256
IACR Transactions on Symmetric Cryptology, 2021 Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP.
Amit Kumar Chauhan +2 more
doaj +4 more sources
Double hashing technique in closed hashing search process [PDF]
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 double hashing technique where the data will be formed into the table with same length and then ...
Robbi Rahim +2 more
semanticscholar +4 more sources
The analysis of double hashing(Extended Abstract) [PDF]
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 randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemerédi
semanticscholar +3 more sources
Double hashing thresholds via local weak convergence [PDF]
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013 A 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 with high probability in the limit of large systems; various techniques have successfully been used to answer this ...
Mathieu Leconte
semanticscholar +6 more sources
More analysis of double hashing [PDF]
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988 In [8], a deep and elegant analysis shows that double hashing is asymptotically equivalent to the ideal uniform hashing up to a load factor of about 0.319. In this paper we show how a randomization technique can be used to develop a surprisingly simple proof of the result that this equivalence holds for load factors arbitrarily close to 1.
George S. Lueker, Mariko Molodowitch
semanticscholar +4 more sources