STOC
2010
ACM
13 years 10 months ago
2010
ACM
STOC
2010
ACM
13 years 10 months ago
2010
ACM
STOC
2010
ACM
14 years 19 days ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
STOC
2010
ACM
14 years 4 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...