We propose the matrix mechanism, a new algorithm for answering a workload of predicate counting queries, and investigate the problem of computing the optimal query strategy in support of a given workload.Expand

We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a representation of a graph to determine the properties of the graph.Expand

We formalize a potentially rich new streaming model, the semi-streaming model, that we believe is necessary for the fruitful study of efficient algorithms for solving problems on massive graphs whose edge sets cannot be stored in memory.Expand

When processing massive data sets, a core task is to construct synopses of the data. To be useful, a synopsis data structure should be easy to construct while also yielding good approximations of the… Expand

We study the core mining problem of clustering on uncertain data, and define appropriate natural generalizations of standard clustering optimization criteria that generalize both traditional k-center and k-median objectives.Expand

We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q.Expand