Sergei Artemenko

According to our database, Sergei Artemenko authored at least 7 papers between 2011 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Constructions of generalized pseudorandom objects.

Sergei Artemenko

PhD thesis, 2016

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Comput. Complex., 2016

Pseudorandomness When the Odds are Against You.

Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Electron. Colloquium Comput. Complex., 2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Pseudorandom generators with optimal seed length for non-boolean poly-size circuits.

Sergei Artemenko, Ronen Shaltiel

Proceedings of the Symposium on Theory of Computing, 2014

2011

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.

Sergei Artemenko, Ronen Shaltiel

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011