241 search results - page 31 / 49 » Graphs, Hypergraphs and Hashing |
119
Voted
RSA
2011
14 years 8 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
133
Voted
IACR
2011
14 years 1 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
107
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
106
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
91
Voted
FSE
2005
Springer
15 years 7 months ago
2005
Springer
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...