740 search results - page 22 / 148 » Lower bounds for Buchsbaum* complexes |
160
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...
198
click to vote
SIAMCOMP
2010
15 years 22 days ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
192
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
157
click to vote
COCO
2007
Springer
16 years 5 days ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
134
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...