2 papers
cs.DS2026
Constructions of -Min-Wise Hash from Bounded Independence
Xue Chen, Shengtang Huang, Xin Li
The paper determines the exact amount of bounded independence required for k‑min‑wise hashing, proving that Θ(k + log 1/δ)-wise independence is both sufficient and necessary, and d…
cs.DS2025
Explicit Min-wise Hash Families with Optimal Size
Xue Chen, Shengtang Huang, Xin Li
We study explicit constructions of min-wise hash families and their extension to -min-wise hash families. Informally, a min-wise hash family guarantees that for any fixed subset…