388 search results - page 6 / 78 » Robust Lower Bounds for Communication and Stream Computation |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
107
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
83
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
115
click to vote
DFG
1992
Springer
15 years 1 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
ECCC
2010
14 years 9 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...