Preprint
Aug 2026
Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries
This work studies the data structure version of the data structure version of the All-Distinct queries, and proves a cell-probe space-time tradeoff lower bound showing that any index using $n/b$ bits must have $\Omega(b/\log{b})$ query time.
Philip Bille, J. Fischer, Inge Li Gørtz et al.
· 0 citations