Add to ORKGQuick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the collision distance of a linear hashing function and for a dual function (called the restriction distance), which relates to the accessibility of addresses by sets of keys and the uniform distribution of sets of keys over addresses
In this paper we use coding theory to give simple explanations of some recent results on universal h...
In this lecture we will be talking about algorithms for estimating similarity. Fix a collection C of...
Locality sensitive hashing (LSH) is a key algorithmic tool that lies at the heart of many informatio...
Abstract. We illustrate how coding theory was applied in the design of the cryp-tographic hash funct...
Hashing is used to learn binary-code representation for data with expectation of preserving the neig...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
We introduce a class of hash functions with the property that messages with the same hash are well s...
This paper considers iterated hash functions. It proposes new constructions of fast and secure compr...
This lecture discusses a very neat paper of Mitzenmacher and Vadhan [8], which proposes a robust mea...
Abstract. There is a foundational problem involving collision-resistant hash-functions: common const...
We have found an operation between permutations in the symmetric group Sn upon which we have experim...
Abstract—This paper considers iterated hash functions. It pro-poses new constructions of fast and se...
In this paper we use coding theory to give simple explanations of some recent results on universal h...
In this lecture we will be talking about algorithms for estimating similarity. Fix a collection C of...
Locality sensitive hashing (LSH) is a key algorithmic tool that lies at the heart of many informatio...
Abstract. We illustrate how coding theory was applied in the design of the cryp-tographic hash funct...
Hashing is used to learn binary-code representation for data with expectation of preserving the neig...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
We introduce a class of hash functions with the property that messages with the same hash are well s...
This paper considers iterated hash functions. It proposes new constructions of fast and secure compr...
This lecture discusses a very neat paper of Mitzenmacher and Vadhan [8], which proposes a robust mea...
Abstract. There is a foundational problem involving collision-resistant hash-functions: common const...
We have found an operation between permutations in the symmetric group Sn upon which we have experim...
Abstract—This paper considers iterated hash functions. It pro-poses new constructions of fast and se...
In this paper we use coding theory to give simple explanations of some recent results on universal h...
In this lecture we will be talking about algorithms for estimating similarity. Fix a collection C of...
Locality sensitive hashing (LSH) is a key algorithmic tool that lies at the heart of many informatio...