ACM - Normas
Piotr Indyk
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07
Algorithms and Complexity, 2004
Lattice problems and norm embeddings
Extracting all the randomness and reducing the error in Trevisan’s extractors
On quasi-orthogonal signatures for CDMA systems
Sparse representations in unions of bases
Uncertainty Principles and Signal Recovery