We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests.
Michael Kaminsky
Author Archives
Don’t Settle For Eventual Consistency
Stronger properties for low-latency geo-replicated storage.
FAWN: A Fast Array of Wimpy Nodes
This paper presents a fast array of wimpy nodes — FAWN — an approach for achieving low-power data-intensive data-center computing.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved