STOC
2001
ACM
15 years 1 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
STOC
2001
ACM
15 years 1 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
STOC
2001
ACM
15 years 1 months ago
2001
ACM
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
STOC
2001
ACM
15 years 1 months ago
2001
ACM
STOC
2001
ACM
15 years 1 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...