Sciweavers

STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 11 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 11 months ago
Local embeddings of metric spaces
Ittai Abraham, Yair Bartal, Ofer Neiman
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
14 years 11 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder
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