388 search results - page 2 / 78 » Robust Lower Bounds for Communication and Stream Computation |
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...