Sciweavers

Share
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
8 years 9 months ago
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur...
STOC
2010
ACM
238views Algorithms» more  STOC 2010»
8 years 9 months ago
Almost tight bounds for rumour spreading with conductance
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
8 years 11 months ago
Load balancing and orientability thresholds for random hypergraphs
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...
Pu Gao, Nicholas C. Wormald
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
9 years 2 months ago
Changing Base without Losing Space
Yevgeniy Dodis and Mihai Patrascu and Mikkel Thoru...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
9 years 2 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
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...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
9 years 3 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
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...
Mohsen Bayati, David Gamarnik, Prasad Tetali
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
9 years 3 months ago
Measuring independence of datasets
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...
Vladimir Braverman, Rafail Ostrovsky
STOC
2010
ACM
159views Algorithms» more  STOC 2010»
9 years 3 months ago
On the Complexity of Circuit Satisfiability
Ramamohan Paturi and Pavel Pudl\’ak
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
9 years 3 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
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...
Prasad Raghavendra, David Steurer and Prasad Tetal...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
9 years 3 months ago
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
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 ...
Iftach Haitner, Omer Reingold and Salil Vadhan
books