|
§
A.
Akavia, S. Goldwasser and V. Vaikuntanathan
Simultaneous Hardcore Bits and Cryptography
against Memory Attacks
Proceedings of the 6th Theory of
Cryptography Conference, 2009 (TCC’09)pdf
|
|
|
§
A. Akavia
Finding Significant Fourier
Coefficients Deterministically
& Locally
ECCC Report TR08-102, 2008 pdf
|
|
|
§
A. Akavia
Very Local Self Correcting of
Homomorphism and Multiplication Codes
DIMACS
Workshop on Property Testing, March 30 - April 2, 2009
|
|
|
§
A. Akavia, T. Malkin and
A. T. Wan
On the Hardness of Hardness of Learning
|
|
|
§
A. Akavia and R.
Venkatesan
Perturbation Codes
46th Annual Allerton Conference, Sept 23-26, 2008,
University of Illinois at Urbana-Champaign, IL, USA (Allerton’08) pdf
(Preliminary version presented in IPAM, 2006)
|
|
|
§
A. Akavia, O. Goldreich,
S. Goldwasser and D. Moshkovitz
On Basing One-Way Functions on NP-Hardness
Proceedings of the 38th annual ACM symposium on Theory of Computing,
pages 701-710, May 2006 (STOC’06) pdf
|
|
|
§
A. Akavia, S. Goldwasser
and S. Safra
Proving Hard-Core Predicates Using List Decoding,
Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer
Science, pages 146-157, October 2003 (FOCS’03) pdf
|
|
|
§ A. Akavia, H. Senderowitz, A. Lerner and R. Shamir
Designing Multi-Route Synthesis in Combinatorial Chemistry,
Journal of Combinatorial Chemistry Vol. 6 No. 4 pp 540—548, 2004 pdf
|
|
|
§ A. Akavia and S. Safra
On the Complexity of Flexible Approximation Problems
Manuscript, 2002
|
|
|
Surveys and Dissertations
|
|
|
§
A. Akavia
Approximating Significant Fourier
Coefficients
The Encyclopedia of Algorithms,
Springer-Verlag, 2008. pdf
|
|
|
§
My Ph.D. thesis:
Learning Noisy Characters, Multiplication
Codes and Hardcore Predicates.
Defended at MIT, August 2007pdf
|
|
|
§
My M.Sc. thesis:
Designing Multi-Route Synthesis in Combinatorial Chemistry -
Complexity and Algorithms
Defended at Tel Aviv University, January 2003
|
|
|
|
|
|
|
