Login / Signup
Sergei Artemenko
Publication Activity (10 Years)
Years Active: 2011-2017
Publications (10 Years): 6
Top Topics
Upper Bound
Absolute Error
Random Number
Pseudorandom
Top Venues
Comput. Complex.
Electron. Colloquium Comput. Complex.
Computational Complexity Conference
ACM Trans. Comput. Theory
</>
Publications
</>
Sergei Artemenko
,
Ronen Shaltiel
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits.
ACM Trans. Comput. Theory
9 (2) (2017)
Sergei Artemenko
,
Russell Impagliazzo
,
Valentine Kabanets
,
Ronen Shaltiel
Pseudorandomness When the Odds are Against You.
Computational Complexity Conference
(2016)
Benny Applebaum
,
Sergei Artemenko
,
Ronen Shaltiel
,
Guang Yang
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.
Comput. Complex.
25 (2) (2016)
Sergei Artemenko
,
Russell Impagliazzo
,
Valentine Kabanets
,
Ronen Shaltiel
Pseudorandomness when the odds are against you.
Electron. Colloquium Comput. Complex.
23 (2016)
Benny Applebaum
,
Sergei Artemenko
,
Ronen Shaltiel
,
Guang Yang
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.
Electron. Colloquium Comput. Complex.
22 (2015)
Benny Applebaum
,
Sergei Artemenko
,
Ronen Shaltiel
,
Guang Yang
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).
Computational Complexity Conference
(2015)
Sergei Artemenko
,
Ronen Shaltiel
Pseudorandom generators with optimal seed length for non-boolean poly-size circuits.
STOC
(2014)
Sergei Artemenko
,
Ronen Shaltiel
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.
Comput. Complex.
23 (1) (2014)
Sergei Artemenko
,
Ronen Shaltiel
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification.
Electron. Colloquium Comput. Complex.
18 (2011)
Sergei Artemenko
,
Ronen Shaltiel
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.
APPROX-RANDOM
(2011)