Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

61

ECCC
2011

favoriteEmaildiscussreport

160views ECommerce» more ECCC 2011»

Robust Lower Bounds for Communication and Stream Computation

14 years 4 months ago

Robust Lower Bounds for Communication and Stream Computation

Download www.cs.umass.edu

Amit Chakrabarti, Graham Cormode, Andrew McGregor

Real-time Traffic

ECCC 2011 | ECommerce |

claim paper

Related Content

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasin...

» Lower bounds for numberinhand multiparty communication complexity made easy

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness

» An Optimal Lower Bound on the Communication Complexity of GapHammingDistance

» Lower bounds for randomized readwrite stream algorithms

» Lower bounds for sorting with few random accesses to external memory

» Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	ECCC
Authors	Amit Chakrabarti, Graham Cormode, Andrew McGregor

Comments (0)