b52_·11 माह पहले·discussI'd argue that one billion is fairly large for what most people work on. But yes, point taken.
b52_·11 माह पहले·discussWhat do you mean? Modulo is not a perfect hash function... What if your hash table had size 11 and you hash two keys of 22 and 33?I also don't understand your first point. We can run n^2 algorithms on massive inputs given its just a polynomial. Are you thinking of 2^n perhaps?
b52_·2 वर्ष पहले·discussHey ot,We worked on improvements to this following our reproducibility study including a synchronized iterative version and alternative estimation functions.You can find the paper here if you're still interested!https://jmmackenzie.io/publication/tkde22/