Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Alon, Noga
and
Mansour, Yishay
1995.
ϵ-discrepancy sets and their application for interpolation of sparse polynomials.
Information Processing Letters,
Vol. 54,
Issue. 6,
p.
337.
Chazelle, Bernard
1998.
Algorithms and Computation.
Vol. 1533,
Issue. ,
p.
1.
Ben-Sasson, Eli
Sudan, Madhu
Vadhan, Salil
and
Wigderson, Avi
2003.
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets.
p.
612.
Shpilka, A.
2006.
Constructions of Low-Degree and Error-Correcting \in-Biased Generators.
p.
33.
Ambainis, Andris
and
Nahimovs, Nikolajs
2008.
Theory of Quantum Computation, Communication, and Cryptography.
Vol. 5106,
Issue. ,
p.
47.
Akavia, Adi
and
Venkatesan, Ramarathnam
2008.
Perturbation codes.
p.
1403.
Lovett, Shachar
Reingold, Omer
Trevisan, Luca
and
Vadhan, Salil
2009.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 5687,
Issue. ,
p.
615.
Ambainis, Andris
and
Nahimovs, Nikolajs
2009.
Improved constructions of quantum automata.
Theoretical Computer Science,
Vol. 410,
Issue. 20,
p.
1916.
Bourgain, Jean
Dilworth, Stephen
Ford, Kevin
Konyagin, Sergei
and
Kutzarova, Denka
2011.
Explicit constructions of RIP matrices and related problems.
Duke Mathematical Journal,
Vol. 159,
Issue. 1,
Tang, Linqing
2011.
On the derandomization of the graph test for homomorphism over groups.
Theoretical Computer Science,
Vol. 412,
Issue. 18,
p.
1718.
Akavia, Adi
2014.
Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions.
IEEE Transactions on Information Theory,
Vol. 60,
Issue. 3,
p.
1733.
Ablayev, Farid
and
Vasiliev, Alexander
2014.
Computing with New Resources.
Vol. 8808,
Issue. ,
p.
149.
Ablayev, Farid
and
Ablayev, Marat
2014.
Descriptional Complexity of Formal Systems.
Vol. 8614,
Issue. ,
p.
42.
Akavia, Adi
2014.
Explicit small sets with ε-discrepancy on Bohr sets.
Information Processing Letters,
Vol. 114,
Issue. 10,
p.
564.
Meka, Raghu
Reingold, Omer
Rothblum, Guy N.
and
Rothblum, Ron D.
2014.
Automata, Languages, and Programming.
Vol. 8572,
Issue. ,
p.
859.
Ablayev, F
and
Ablayev, M
2015.
On the concept of cryptographic quantum hashing.
Laser Physics Letters,
Vol. 12,
Issue. 12,
p.
125204.
Ablayev, F.
and
Ablayev, M.
2015.
Quantum hashing via ∈-universal hashing constructions and classical fingerprinting.
Lobachevskii Journal of Mathematics,
Vol. 36,
Issue. 2,
p.
89.
Ablayev, Farid Mansurovich
and
Ablayev, Marat Faridovich
2016.
On the concept of quantum hashing.
Математические вопросы криптографии,
Vol. 7,
Issue. 2,
p.
7.
Vasiliev, Alexander Valeryevich
and
Ziiatdinov, Mansur Tagirovich
2016.
Minimizing collisions for quantum hashing.
Математические вопросы криптографии,
Vol. 7,
Issue. 2,
p.
47.
Sherstov, Alexander A.
2021.
The hardest halfspace.
computational complexity,
Vol. 30,
Issue. 2,