87 search results - page 6 / 18 » focs 2008 |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...
LATINCRYPT
2010
13 years 8 months ago
2010
This paper discusses the security of a leakage-resilient stream cipher presented at FOCS 2008, instantiated in a practical setting. Based on a case study, we put forward implementa...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...