231 search results - page 20 / 47 » Two lower bounds for self-assemblies at temperature 1 |
152
click to vote
MOBIHOC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
172
click to vote
COMPGEOM
2009
ACM
16 years 17 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
166
click to vote
COMPGEOM
2009
ACM
16 years 17 days ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
133
click to vote
SPDP
1991
IEEE
15 years 9 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
146
click to vote
RSA
1998
15 years 5 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...