250 citations · 1.1k across the 76 of their papers we have counts for
5 papers · 1 filter
Robust Set Reconciliation via Locality Sensitive Hashing
Michael Mitzenmacher, Tom Morgan
We consider variations of set reconciliation problems where two parties, Alice and Bob, each hold a set of points in a metric space, and the goal is for Bob to conclude with a set…
Directory Reconciliation
Michael Mitzenmacher, Tom Morgan
We initiate the theoretical study of directory reconciliation, a generalization of document exchange, in which Alice and Bob each have different versions of a set of documents that…
Metric Sublinear Algorithms via Linear Sampling
Hossein Esfandiari, Michael Mitzenmacher
In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a s…
Optimizing Learned Bloom Filters by Sandwiching
Michael Mitzenmacher
We provide a simple method for improving the performance of the recently introduced learned Bloom filters, by showing that they perform better when the learned function is sandwich…
A Model for Learned Bloom Filters and Related Structures
Michael Mitzenmacher
Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying machine learning to model the data set the Bloom filter is meant to represent. Here we mo…