Sciweavers

STOC
2000
ACM
123views Algorithms» more  STOC 2000»
13 years 9 months ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 9 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
STOC
2000
ACM
81views Algorithms» more  STOC 2000»
13 years 9 months ago
A unified approach to approximating resource allocation and scheduling
Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Jose...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 10 months ago
Approximate nearest neighbors and sequence comparison with block operations
S. Muthukrishnan, Süleyman Cenk Sahinalp
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 10 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
STOC
2000
ACM
122views Algorithms» more  STOC 2000»
13 years 10 months ago
Polynomial-time approximation scheme for data broadcast
Claire Kenyon, Nicolas Schabanel, Neal E. Young