34 citations · 131 across the 30 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.DS2017★ 4 cited
A Fast x86 Implementation of Select
Prashant Pandey, Michael A. Bender, Rob Johnson
Rank and select are fundamental operations in succinct data structures, that is, data structures whose space consumption approaches the information-theoretic optimal. The performan…