Share:

Sergei Artemenko

ScholarGPS® ID: 35664503849111

Affiliation

University of Haifa, Haifa, Israel

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Metrics Summary

Publication Count

7

Predicted Citations

54

Predicted h-index

5

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits (journal article) Artemenko, Sergei \| Shaltiel, Ronen ACM Transactions on Computation Theory, volume 9, issue 2, pages 1-26 (2017). 10.1145/3018057 Cited by (5) \| Cite \| Source
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (journal article) Applebaum, Benny \| Artemenko, Sergei \| Shaltiel, Ronen \| Yang, Guang computational complexity, volume 25, issue 2, pages 349-418 (2016). 10.1007/s00037-016-0128-9 Cited by (9) \| Cite \| Source
Pseudorandomness when the odds are against you (conference) Artemenko, Sergei \| Impagliazzo, Russell \| Kabanets, Valentine \| Shaltiel, Ronen Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.9 Cited by (3) \| Cite \| Source
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract) (conference) Applebaum, Benny \| Artemenko, Sergei \| Shaltiel, Ronen \| Yang, Guang Conference on Computational Complexity (2015) 10.4230/LIPIcs.CCC.2015.582 Cited by (5) \| Cite \| Source
Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (conference) Artemenko, Sergei \| Shaltiel, Ronen STOC '14: Symposium on Theory of Computing (2014) New York New York 10.1145/2591796.2591846 Cited by (3) \| Cite \| Source
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (journal article) Artemenko, Sergei \| Shaltiel, Ronen computational complexity, volume 23, issue 1, pages 43-83 (2014). 10.1007/s00037-012-0056-2 Cited by (12) \| Cite \| Source \| Open Access
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Artemenko, Sergei \| Shaltiel, Ronen Springer Berlin Heidelberg (2011) 10.1007/978-3-642-22935-0_32 Cited by (5) \| Cite \| Source \| Open Access