Sciweavers

45 search results - page 6 / 9
» approx 2009
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
14 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 4 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
14 years 4 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
14 years 4 months ago
On the Security of Goldreich's One-Way Function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
Andrej Bogdanov, Youming Qiao
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 4 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...