STOC
2003
ACM
15 years 6 months 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...
STOC
2003
ACM
15 years 6 months ago
2003
ACM
STOC
2003
ACM
15 years 6 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...
STOC
2003
ACM
15 years 6 months 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...
STOC
2003
ACM
15 years 6 months 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...
STOC
2003
ACM
15 years 6 months 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...
STOC
2003
ACM
15 years 6 months 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 ...
STOC
2003
ACM
15 years 6 months ago
2003
ACM
STOC
2003
ACM
15 years 6 months ago
2003
ACM
STOC
2003
ACM
15 years 6 months ago
2003
ACM