4 ms·
A Hash Table's double hashing [1] creates an arithmetic progression. Improving bounds of this theorem could lead to faster, smaller hash-tables. This is the fir
by rrobukef 4y ago
A Hash Table's double hashing [1] creates an arithmetic progression. Improving bounds of this theorem could lead to faster, smaller hash-tables. This is the first wild speculation I could come up with.
[1] https://en.wikipedia.org/wiki/Double_hashing https://en.wikipedia.org/wiki/Double_hashing