On Sparse Parity Check Matrices
Designs, Codes and Cryptography
Sparse 0-1-matrices and forbidden hypergraphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
European Journal of Combinatorics
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs
Studies in complexity and cryptography
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |