11 search results - page 2 / 3 » An Analysis of Random-Walk Cuckoo Hashing |
CORR
2012
Springer
12 years 11 days ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
MICRO
2007
IEEE
13 years 11 months ago
2007
IEEE
Transactional Memory (TM) systems must track the read and write sets—items read and written during a transaction—to detect conflicts among concurrent transactions. Several TM...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
ICDCS
2006
IEEE
13 years 10 months ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
STOC
2010
ACM
13 years 4 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...