Sciweavers

COCO
2004
Springer
91views Algorithms» more  COCO 2004»
15 years 10 months ago
Compression of Samplable Sources
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
Luca Trevisan, Salil P. Vadhan, David Zuckerman