Results 111 to 120 of about 20,415 (157)

DOUBLE HASHING WITH MULTIPLE PASSBITS

International Journal of Foundations of Computer Science, 2003
We present a novel extension to passbits providing significant reduction to unsuccessful search lengths for open addressing collision resolution hashing. Both the experimental and analytical results presented demonstrate the dramatic reductions possible.
Martini, Paul M., Burkhard, Walter A.
openaire   +2 more sources

More analysis of double hashing

Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lueker, George S., Molodowitch, Mariko
openaire   +2 more sources

Peeling arguments and double hashing

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012
The analysis of several algorithms and data structures can be reduced to the analysis of the following greedy “peeling” process: start with a random hypergraph; find a vertex of degree at most k, and remove it and all of its adjacent hyperedges from the graph; repeat until there is no suitable vertex.
Michael Mitzenmacher, Justin Thaler
openaire   +1 more source

Double hashing

Journal of the American Society for Information Science, 1972
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire   +1 more source

Double hashing with passbits

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Remainder Quotient Double Hashing Technique in Closed Hashing Search Process

SSRN Electronic Journal, 2019
Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
STUTI PANDEY, Abhay Kumar Agarwal
openaire   +1 more source

Double-Hashing Operation Mode for Encryption

2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), 2017
Block ciphers, hash-based encryption, and public-key ciphers are examples of data encryption techniques with different desired features. Strong block ciphers, like AES, must run in some mode of operation to encrypt data larger than the block size. Public-key ciphers, like RSA, are costly and usually used for key-sharing rather than encrypting the data ...
Sultan Almuhammadi, Ahmad Amro
openaire   +1 more source

Attacks on Fast Double Block Length Hash Functions

Journal of Cryptology, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Knudsen, Lars R., Lai, Xuejia, Preneel, Bart   +2 more
openaire   +1 more source

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 randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemeredi
openaire   +1 more source

Double-Coding Density Sensitive Hashing

2017
This paper proposes a double-coding density sensitive hashing (DCDSH) method. DCDSH accomplishes approximate nearest neighbor (ANN) search tasks based on its double coding scheme. First, DCDSH generates real-valued hash codes by projecting objects along the principle hyper-planes.
Xiaoliang Tang, Xing Wang, Di Jia, Weidong Song, Xiangfu Meng   +4 more
openaire   +1 more source