Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sergei Artemenko
@article{DBLP:journals/toct/ArtemenkoS17,
author = {Sergei Artemenko and
Ronen Shaltiel},
title = {Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size
Circuits},
journal = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {2},
pages = {6:1--6:26},
year = {2017},
url = {https://doi.org/10.1145/3018057},
doi = {10.1145/3018057},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/ArtemenkoS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Artemenko16,
author = {Sergei Artemenko},
title = {Constructions of generalized pseudorandom objects},
school = {University of Haifa, Israel},
year = {2016},
url = {https://haifa.userservices.exlibrisgroup.com/view/delivery/972HAI\_MAIN/12141294270002791},
timestamp = {Fri, 20 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Artemenko16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ApplebaumASY16,
author = {Benny Applebaum and
Sergei Artemenko and
Ronen Shaltiel and
Guang Yang},
title = {Incompressible Functions, Relative-Error Extractors, and the Power
of Nondeterministic Reductions},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {349--418},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0128-9},
doi = {10.1007/S00037-016-0128-9},
timestamp = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumASY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArtemenkoIKS16,
author = {Sergei Artemenko and
Russell Impagliazzo and
Valentine Kabanets and
Ronen Shaltiel},
editor = {Ran Raz},
title = {Pseudorandomness When the Odds are Against You},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {9:1--9:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.9},
doi = {10.4230/LIPICS.CCC.2016.9},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArtemenkoIKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArtemenkoIKS16,
author = {Sergei Artemenko and
Russell Impagliazzo and
Valentine Kabanets and
Ronen Shaltiel},
title = {Pseudorandomness when the odds are against you},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-037}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/037},
eprinttype = {ECCC},
eprint = {TR16-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArtemenkoIKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ApplebaumASY15,
author = {Benny Applebaum and
Sergei Artemenko and
Ronen Shaltiel and
Guang Yang},
editor = {David Zuckerman},
title = {Incompressible Functions, Relative-Error Extractors, and the Power
of Nondeterministic Reductions (Extended Abstract)},
booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
2015, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {33},
pages = {582--600},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.582},
doi = {10.4230/LIPICS.CCC.2015.582},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/ApplebaumASY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumASY15,
author = {Benny Applebaum and
Sergei Artemenko and
Ronen Shaltiel and
Guang Yang},
title = {Incompressible Functions, Relative-Error Extractors, and the Power
of Nondeterminsitic Reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-051}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/051},
eprinttype = {ECCC},
eprint = {TR15-051},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumASY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArtemenkoS14,
author = {Sergei Artemenko and
Ronen Shaltiel},
title = {Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions
Showing Hardness Amplification},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {43--83},
year = {2014},
url = {https://doi.org/10.1007/s00037-012-0056-2},
doi = {10.1007/S00037-012-0056-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ArtemenkoS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArtemenkoS14,
author = {Sergei Artemenko and
Ronen Shaltiel},
editor = {David B. Shmoys},
title = {Pseudorandom generators with optimal seed length for non-boolean poly-size
circuits},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {99--108},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591846},
doi = {10.1145/2591796.2591846},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArtemenkoS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ArtemenkoS11,
author = {Sergei Artemenko and
Ronen Shaltiel},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions
Showing Hardness Amplification},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {377--388},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_32},
doi = {10.1007/978-3-642-22935-0\_32},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ArtemenkoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArtemenkoS11,
author = {Sergei Artemenko and
Ronen Shaltiel},
title = {Lower bounds on the query complexity of non-uniform and adaptive reductions
showing hardness amplification},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-016}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/016},
eprinttype = {ECCC},
eprint = {TR11-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArtemenkoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 18:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
