Search Sciweavers | Sciweavers

25

ECCC
2000

140views more ECCC 2000»

Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

13 years 7 months ago

We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...

Pavlos Efraimidis, Paul G. Spirakis

claim paper

Read More »

36

click to vote

ECCC
2007

147views more ECCC 2007»

Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs

13 years 7 months ago

Download www.cs.cmu.edu

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...

Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...

claim paper

Read More »

20

click to vote

APPROX
2009
Springer

98views Algorithms» more APPROX 2009»

On the Security of Goldreich's One-Way Function

14 years 2 months ago

Download itcs.tsinghua.edu.cn

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 ﬁxed predicate P of a constant number ...

Andrej Bogdanov, Youming Qiao

claim paper

Read More »

23

click to vote

TCC
2009
Springer

169views Cryptology» more TCC 2009»

Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

14 years 8 months ago

Download www.cs.berkeley.edu

Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...

James Cook, Omid Etesami, Rachel Miller, Luca Trev...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers