Sciweavers

26 search results - page 2 / 6

» stoc 1997

13

STOC
1997
ACM

88views Algorithms» more STOC 1997»

Spectral Techniques for Expander Codes

13 years 10 months ago

Spectral Techniques for Expander Codes

Download www.cs.yale.edu

John D. Lafferty, Daniel N. Rockmore

claim paper

Read More »

12

STOC
1997
ACM

91views Algorithms» more STOC 1997»

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets

13 years 10 months ago

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets

Download www.cs.umd.edu

Peter Auer, Philip M. Long, Aravind Srinivasan

claim paper

Read More »

9

STOC
1997
ACM

82views Algorithms» more STOC 1997»

Reducing the Complexity of Reductions

13 years 10 months ago

Reducing the Complexity of Reductions

Download www.cs.rutgers.edu

Manindra Agrawal, Eric Allender, Russell Impagliaz...

claim paper

Read More »

23

STOC
1997
ACM

116views Algorithms» more STOC 1997»

Direct Product Results and the GCD Problem, in Old and New Communication Models

13 years 10 months ago

Direct Product Results and the GCD Problem, in Old and New Communication Models

Download www.math.ias.edu

This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:

Itzhak Parnafes, Ran Raz, Avi Wigderson

claim paper

Read More »

21

STOC
1997
ACM

129views Algorithms» more STOC 1997»

Better Bounds for Online Scheduling

13 years 10 months ago

Better Bounds for Online Scheduling

Download www2.informatik.hu-berlin.de

We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...

Susanne Albers

claim paper

Read More »

« Prev « First page 2 / 6 Last » Next »