235
click to vote
STOC
16 years 1 months ago
2003 ACM 
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
109
click to vote
STOC
16 years 1 months ago
2003 ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
124
click to vote
STOC
16 years 1 months ago
2003 ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
120
click to vote
STOC
16 years 1 months ago
2003 ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
118
click to vote
STOC
16 years 1 months ago
2003 ACM 
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
|
Algorithms