118 search results - page 19 / 24 » soda 2008 |
TALG
2010
14 years 8 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
100
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
79
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
SODA
2008
ACM
14 years 11 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...