83 search results - page 1 / 17 » Linear probing with constant independence |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
SIAMCOMP
2012
11 years 7 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
WG
2007
Springer
13 years 10 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...