Andris Ambainis, Nikolajs Nahimovs, “Improved constructions of quantum automata”, Theoretical Computer Science, 410, no. 20, 2009, 1916
Adi Akavia, “Explicit small sets with ε-discrepancy on Bohr sets”, Information Processing Letters, 114, no. 10, 2014, 564
Linqing Tang, “On the derandomization of the graph test for homomorphism over groups”, Theoretical Computer Science, 412, no. 18, 2011, 1718
Noga Alon, Yishay Mansour, “ϵ-discrepancy sets and their application for interpolation of sparse polynomials”, Information Processing Letters, 54, no. 6, 1995, 337
Adi Akavia, Ramarathnam Venkatesan, 2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008, 1403
F. Ablayev, M. Ablayev, “Quantum hashing via ∈-universal hashing constructions and classical fingerprinting”, Lobachevskii J Math, 36, no. 2, 2015, 89
Andris Ambainis, Nikolajs Nahimovs, 5106, Theory of Quantum Computation, Communication, and Cryptography, 2008, 47
Farid Mansurovich Ablayev, Marat Faridovich Ablayev, “On the concept of quantum hashing”, Математические вопросы криптографии, 7, no. 2, 2016, 7
A. Shpilka, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 33
Farid Ablayev, Alexander Vasiliev, 8808, Computing with New Resources, 2014, 149