Models and issues in data stream systems

B Babcock, S Babu, M Datar, R Motwani… - Proceedings of the twenty …, 2002 - dl.acm.org
In this overview paper we motivate the need for and research issues arising from a new
model of data processing. In this model, data does not take the form of persistent relations …

Sybillimit: A near-optimal social network defense against sybil attacks

H Yu, PB Gibbons, M Kaminsky… - 2008 IEEE Symposium …, 2008 - ieeexplore.ieee.org
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable
to sybil attacks, where a malicious user pretends to have multiple identities (called sybil …

SIA: Secure information aggregation in sensor networks

B Przydatek, D Song, A Perrig - … of the 1st international conference on …, 2003 - dl.acm.org
Sensor networks promise viable solutions to many monitoring problems. However, the
practical deployment of sensor networks faces many challenges imposed by real-world …

Estimating the unseen: an n/log (n)-sample estimator for entropy and support size, shown optimal via new CLTs

G Valiant, P Valiant - Proceedings of the forty-third annual ACM …, 2011 - dl.acm.org
We introduce a new approach to characterizing the unobserved portion of a distribution,
which provides sublinear--sample estimators achieving arbitrarily small additive constant …

An automatic inequality prover and instance optimal identity testing

G Valiant, P Valiant - SIAM Journal on Computing, 2017 - SIAM
We consider the problem of verifying the identity of a distribution: Given the description of a
distribution over a discrete finite or countably infinite support, p=(p_1,p_2,...), how many …

Synopsis diffusion for robust aggregation in sensor networks

S Nath, PB Gibbons, S Seshan… - ACM Transactions on …, 2008 - dl.acm.org
Previous approaches for computing duplicate-sensitive aggregates in wireless sensor
networks have used a tree topology, in order to conserve energy and to avoid double …

Testing that distributions are close

T Batu, L Fortnow, R Rubinfeld… - … on Foundations of …, 2000 - ieeexplore.ieee.org
Given two distributions over an n element set, we wish to check whether these distributions
are statistically close by only sampling. We give a sublinear algorithm which uses O (n/sup …

Estimating the unseen: improved estimators for entropy and other properties

G Valiant, P Valiant - Journal of the ACM (JACM), 2017 - dl.acm.org
We show that a class of statistical properties of distributions, which includes such practically
relevant properties as entropy, the number of distinct elements, and distance metrics …

The art of uninformed decisions: A primer to property testing

E Fischer - Current Trends in Theoretical Computer Science: The …, 2004 - World Scientific
Property testing is a new field in computational theory, that deals with the information that
can be deduced from the input where the number of allowable queries (reads from the input) …

Testing closeness of discrete distributions

T Batu, L Fortnow, R Rubinfeld, WD Smith… - Journal of the ACM …, 2013 - dl.acm.org
Given samples from two distributions over an n-element set, we wish to test whether these
distributions are statistically close. We present an algorithm which uses sublinear in n …