STOC
2001
ACM
15 years 1 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
STOC
2001
ACM
15 years 1 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
