Results 1 to 10 of about 2,121,909 (245)

Balanced Allocations and Double Hashing [PDF]

open access: greenProceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N.   +7 more
core   +7 more sources

More Analysis of Double Hashing for Balanced Allocations [PDF]

open access: bronze2016 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.
Mitzenmacher, Michael
core   +8 more sources

Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256

open access: diamondIACR 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 Algorithm for Frequency Estimation in Data Streams [PDF]

open access: greenarXiv.org, 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.
Nikita Seleznev   +2 more
semanticscholar   +5 more sources

Double hashing technique in closed hashing search process [PDF]

open access: goldIOP 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   +4 more sources

Double hashing thresholds via local weak convergence [PDF]

open access: green2013 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 ...
M. Leconte
semanticscholar   +6 more sources

The Analysis of Double Hashing

open access: closedJournal 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 depending only on the key \(K\) of the search.
L. Guibas, E. Szemerédi
semanticscholar   +5 more sources

The Cost of Bitcoin Mining Has Never Really Increased [PDF]

open access: yesFrontiers in Blockchain, 2020
The Bitcoin network is burning a large amount of energy for mining. In this paper, we estimate the lower bound for the global mining energy cost for a period of 10 years from 2010 to 2020, taking into account changes in energy costs, improvements in ...
Yo-Der Song   +3 more
doaj   +4 more sources

Load Thresholds for Cuckoo Hashing with Double Hashing [PDF]

open access: yes16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects. Several works have determined load thresholds c^* = c^*(k,l) for k-ary cuckoo hashing; that is, for c c^* no l-orientation ...
M. Mitzenmacher   +2 more
semanticscholar   +4 more sources

An Efficient Retrieval System Framework for Fabrics Based on Fine-Grained Similarity [PDF]

open access: yesEntropy, 2022
In the context of “double carbon”, as a traditional high energy consumption industry, the textile industry is facing the severe challenges of energy saving and emission reduction.
Jun Xiang, Ruru Pan, Weidong Gao
doaj   +2 more sources

Home - About - Disclaimer - Privacy