- Jean Bourgain, Stephen Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova, “Explicit constructions of RIP matrices and related problems”, Duke Math. J., 159, № 1, 2011
- Alexander A. Sherstov, “The hardest halfspace”, comput. complex., 30, № 2, 2021, 11
- Shachar Lovett, Omer Reingold, Luca Trevisan, Salil Vadhan, 5687, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2009, 615
- Farid Ablayev, Marat Ablayev, 8614, Descriptional Complexity of Formal Systems, 2014, 42
- Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum, 8572, Automata, Languages, and Programming, 2014, 859
- F Ablayev, M Ablayev, “On the concept of cryptographic quantum hashing”, Laser Phys. Lett., 12, № 12, 2015, 125204
- Bernard Chazelle, 1533, Algorithms and Computation, 1998, 1
- Adi Akavia, “Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions”, IEEE Trans. Inform. Theory, 60, № 3, 2014, 1733
- Eli Ben-Sasson, Madhu Sudan, Salil Vadhan, Avi Wigderson, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003, 612
- Alexander Valeryevich Vasiliev, Mansur Tagirovich Ziiatdinov, “Minimizing collisions for quantum hashing”, Математические вопросы криптографии, 7, № 2, 2016, 47