250 citations · 1.1k across the 76 of their papers we have counts for
4 papers · 1 filter
Simple Multi-Party Set Reconciliation
Michael Mitzenmacher, Rasmus Pagh
As users migrate information to cloud storage, many distributed cloud-based services use multiple loosely consistent replicas of user information to avoid the high overhead of more…
Coding for Random Projections
Ping Li, Michael Mitzenmacher, Anshumali Shrivastava
The method of random projections has become very popular for large-scale applications in statistical learning, information retrieval, bio-informatics and other applications. Using…
Parallel Peeling Algorithms
Jiayang Jiang, Michael Mitzenmacher, Justin Thaler
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no ve…
Equitability Analysis of the Maximal Information Coefficient, with Comparisons
David Reshef, Yakir Reshef, Michael Mitzenmacher +1
A measure of dependence is said to be equitable if it gives similar scores to equally noisy relationships of different types. Equitability is important in data exploration when the…