2 citations · 4 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Bloom Filters, Adaptivity, and the Dictionary Problem
Michael A. Bender, Martin Farach-Colton, Mayank Goswami +3
The Bloom filter---or, more generally, an approximate membership query data structure (AMQ)---maintains a compact, probabilistic representation of a set S of keys from a universe U…
cs.GT2017
Non-Cooperative Rational Interactive Proofs
Jing Chen, Samuel McCauley, Shikha Singh
Interactive-proof games model the scenario where an honest party interacts with powerful but strategic provers, to elicit from them the correct answer to a computational question.…