308 search results - page 3 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
STOC
2012
ACM
11 years 8 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
IPL
2006
13 years 6 months ago
2006
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
SODA
2010
ACM
13 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...