58 search results - page 2 / 12 » Optimal space lower bounds for all frequency moments |
APPROX
2009
Springer
14 years 26 days ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
FOCS
2008
IEEE
14 years 22 days ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
COCO
2009
Springer
14 years 25 days ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
JCT
2008
13 years 6 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...