Timeline for Proof that probability that hashing with open addressing needs more than $k$ attempts is $2^{-k}$ at most
Current License: CC BY-SA 3.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 7, 2013 at 4:41 | history | answered | Yuval Filmus | CC BY-SA 3.0 |