Sciweavers

STOC
2007
ACM
104views Algorithms» more  STOC 2007»
14 years 11 months ago
Simple deterministic approximation algorithms for counting matchings
Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...
STOC
2007
ACM
169views Algorithms» more  STOC 2007»
14 years 11 months ago
Proportional response dynamics leads to market equilibrium
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...
Fang Wu, Li Zhang
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 11 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
STOC
2007
ACM
71views Algorithms» more  STOC 2007»
14 years 11 months ago
Survivable network design with degree or order constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 11 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 3 days ago
Small-size epsilon-nets for axis-parallel rectangles and boxes
Boris Aronov, Esther Ezra, Micha Sharir
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 3 days ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb