34 citations · 34 across the 2 of their papers we have counts for
2 papers
cs.DS2020
Batched Predecessor and Sorting with Size-Priced Information in External Memory
Michael A. Bender, Mayank Goswami, Dzejla Mededovic +2
In the unit-cost comparison model, a black box takes an input two items and outputs the result of the comparison. Problems like sorting and searching have been studied in this mode…
cs.DB2012★ 34 cited
Don't Thrash: How to Cache Your Hash on Flash
Michael A. Bender, Martin Farach-Colton, Rob Johnson +7
This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has…