250 citations · 1.1k across the 76 of their papers we have counts for
6 papers · 1 filter
Heapable Sequences and Subsequences
John Byers, Brent Heeringa, Michael Mitzenmacher +1
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at…
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
Michael T. Goodrich, Michael Mitzenmacher
Suppose a client, Alice, has outsourced her data to an external storage provider, Bob, because he has capacity for her massive data set, of size n, whereas her private storage is m…
Streaming Graph Computations with a Helpful Advisor
Graham Cormode, Michael Mitzenmacher, Justin Thaler
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a…
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina +3
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is be…
Local cluster aggregation models of explosive percolation
Raissa M. D'Souza, Michael Mitzenmacher
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equati…
Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank
John W. Byers, Michael Mitzenmacher, Georgios Zervas
Innovative auction methods can be exploited to increase profits, with Shubik's famous "dollar auction" perhaps being the most widely known example. Recently, some mainstream e-comm…