Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the Benefits of Adaptivity in Property Testing of Dense Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic Aspects of Property Testing in the Dense Graphs Model
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Introduction to testing graph properties
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Introduction to testing graph properties
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We study the compression of polynomially samplablesources. In particular, we give efficientprefix-free compression and decompression algorithmsfor three classes of such sources (whosesupport is a subset of {0, 1}^n).1. We show how to compress sources ...