How much universal independence is sufficient to guarantee that cuckoo hashing works, and what is the exact threshold density n/m for the d-hash-function, one-table…
Statement
How much universal independence is sufficient to guarantee that cuckoo hashing works, and what is the exact threshold density n/m for the d-hash-function, one-table generalization of cuckoo hashing to work even with fully random hash functions?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.