Sciweavers

26 search results - page 2 / 6
» stoc 1997
Sort
View
STOC
1997
ACM
88views Algorithms» more  STOC 1997»
13 years 9 months ago
Spectral Techniques for Expander Codes
John D. Lafferty, Daniel N. Rockmore
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 9 months ago
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets
Peter Auer, Philip M. Long, Aravind Srinivasan
STOC
1997
ACM
82views Algorithms» more  STOC 1997»
13 years 9 months ago
Reducing the Complexity of Reductions
Manindra Agrawal, Eric Allender, Russell Impagliaz...
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
13 years 9 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
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
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 9 months ago
Better Bounds for Online Scheduling
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