1. 1. Noga Alon, Yossi Matias, Mario Szegedy. The Space Complexity of Approximating the Fre-quency Moments. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 20{29, 1996.
   2.  Kasper Larsen, Jelani Nelson. Optimality of the Johnson-Lindenstrauss Lemma. Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2017.
   3.  [CT65] James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex fourier series. Math. Comp., 19(90):297{301, 4 1965.
   4. [DL42] Gordon C. Danielson and Cornelius Lanczos. Some improvements in practical fourier analysis and their application to x-ray scattering from liquids. J. Franklin Inst., 233(4):365{ 380, 4 1942.
   5. [Mor78] Robert Morris. Counting large numbers of events in small registers. Commun. ACM, 21(10):840{842, 10 1978.8
   6.  [AC09] Nir Ailon and Bernard Chazelle. The fast Johnson{Lindenstrauss transform and ap- proximate nearest neighbors. SIAM J. Comput., 39(1):302{322, 2009.
   7. [BDF+11] Jean Bourgain, Stephen Dilworth, Kevin Ford, Sergei Konyagin, and Denka Kutzarova. Explicit constructions of RIP matrices and related problems. Duke Mathematical Jour- nal, 159(1):145{185, 2011.