Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. - Sergei Artemenko; Ronen Shaltiel (Comput. Complex., 2014)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract). - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (CCC, 2015)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Electron. Colloquium Comput. Complex., 2015)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Comput. Complex., 2016)

Pseudorandomness when the odds are against you. - Sergei Artemenko; Russell Impagliazzo; Valentine Kabanets; Ronen Shaltiel (Electron. Colloquium Comput. Complex., 2016)

Constructions of generalized pseudorandom objects. - Sergei Artemenko (2016)

Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits. - Sergei Artemenko; Ronen Shaltiel (ACM Trans. Comput. Theory, 2017)