Sciweavers

3 search results - page 1 / 1
» Revisiting the Direct Sum Theorem and Space Lower Bounds in ...
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
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...
Sudipto Guha, Zhiyi Huang
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
13 years 10 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff