Author

Mario Szegedy

Created by Alysson Bolognesi Prado at 2019-03-27 15:21:34.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Alessandro Rodrigues e Silva'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

On the degree of Boolean functions as real polynomials

The space complexity of approximating the frequency moments

The Space Complexity of Approximating the Frequency Moments

Proof verification and the hardness of approximation problems

The DLT priority sampling is essentially optimal

Checking computations in polylogarithmic time

...

Published At

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC ’06

Proceedings., 33rd Annual Symposium on Foundations of Computer Science

Journal of the ACM

Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC ’91

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92

Co-Authors

Referenced By

Streaming symmetric norms via measure concentration

Stable distributions, pseudorandom generators, embeddings, and data stream computation

Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm

The price of validity in dynamic networks

How robust are linear sketches to adaptive inputs?

Approximating the cut-norm via Grothendieck’s inequality

...