74 citations · 127 across the 4 of their papers we have counts for
1 paper · 1 filter
Mark Braverman, Gal Oshri
We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer q∈[1,n], and receive a respo…