481 search results - page 12 / 97 » Martin's game: a lower bound for the number of sets |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
SOFSEM
2010
Springer
14 years 5 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
TALG
2008
13 years 8 months ago
2008
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
FOCS
1994
IEEE
14 years 21 days ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
DM
1999
13 years 8 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...