106 search results - page 1 / 22 » Almost random graphs with simple hash functions |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
WG
1993
Springer
13 years 8 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
STACS
2012
Springer
12 years 10 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...