112
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
111
click to vote
STOC
2003
ACM
16 years 28 days ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
60
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
103
Voted
STOC
2003
ACM
16 years 28 days 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...
81
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
89
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
78
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
99
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
69
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
60
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM