Author

Madhu Sudan

Created by ACM worker at 2019-04-10 11:26:09.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Rogério Cysne Araújo's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

Proof verification and the hardness of approximation problems

A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

Symmetric LDPC Codes are not Necessarily Locally Testable

Algebraic property testing

Robust Characterizations of Polynomials with Applications to Program Testing

Pseudorandom Generators without the XOR Lemma

...

Published At

Journal of Computer and System Sciences

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94

SIAM Journal on Computing

2011 IEEE 26th Annual Conference on Computational Complexity

Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97

Co-Authors

Referenced By

Random sampling and approximation of MAX-CSP problems

The geometric maximum traveling salesman problem

Bypassing UGC from Some Optimal Geometric Inapproximability Results

Guest column

Two prover protocols