250
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
The group testing problem consists of determining a sparse subset of a set of items that are “defective” based on a set of possibly noisy tests, and arises in areas such as me...
211
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
A stochastic probing problem consists of a set of elements whose values are independent random variables. The algorithm knows the distributions of these variables, but not the act...
195
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
191
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
253
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
In this paper we prove that the mixing time of a broad class of evolutionary dynamics in finite, unstructured populations is roughly logarithmic in the size of the state space. A...
186
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
222
click to vote
SODA
2016
ACM
10 years 3 months ago
2016
ACM
We show how to solve all-pairs shortest paths on n nodes in deterministic n3/2Ω( √ logn) time, and how to count the pairs of orthogonal vectors among n 0-1 vectors in d = clog...
209
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM
Online d-dimensional vector packing models many settings such as minimizing resources in data centers where jobs have multiple resource requirements (CPU, Memory, etc.). However, ...
180
click to vote
SODA
2016
ACM
10 years 3 months ago
2016
ACM
At SODA’93, Chazelle and Matouˇsek presented a derandomization of Clarkson’s sampling-based algorithm [FOCS’88] for solving linear programs with n constraints and d variabl...
189
Voted
SODA
2016
ACM
10 years 3 months ago
2016
ACM