2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan
We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is…