From the 1 of 1 linked paper with an AI index.
1 paper
Haoran Wang
The paper shows that an s‑wise independent polynomial hash family with s = O(k + log(1/δ)) is sufficient for k‑min‑wise hashing with multiplicative error δ, achieving optimal seed…