Sciweavers

STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 5 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 5 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 5 months ago
A sharp threshold in proof complexity
Dimitris Achlioptas, Paul Beame, Michael S. O. Mol...
Algorithms
Top of PageReset Settings