388 search results - page 5 / 78 » Robust Lower Bounds for Communication and Stream Computation |
155
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
136
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
162
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
239
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...