Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Russell Impagliazzo
@article{DBLP:journals/cc/ImpagliazzoKV23,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
title = {The Power of Natural Properties as Oracles},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {6},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00241-0},
doi = {10.1007/S00037-023-00241-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ImpagliazzoKV23,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
editor = {Nicole Megow and
Adam D. Smith},
title = {Synergy Between Circuit Obfuscation and Circuit Minimization},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {31:1--31:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.31},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.31},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/ImpagliazzoKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoMP23,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
editor = {Amnon Ta{-}Shma},
title = {Lower Bounds for Polynomial Calculus with Extension Variables over
Finite Fields},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.7},
doi = {10.4230/LIPICS.CCC.2023.7},
timestamp = {Mon, 10 Jul 2023 17:09:42 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BussFI23,
author = {Sam Buss and
Noah Fleming and
Russell Impagliazzo},
editor = {Yael Tauman Kalai},
title = {{TFNP} Characterizations of Proof Systems and Monotone Circuits},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {30:1--30:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.30},
doi = {10.4230/LIPICS.ITCS.2023.30},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BussFI23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BunGHILPSS23,
author = {Mark Bun and
Marco Gaboardi and
Max Hopkins and
Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Satchit Sivakumar and
Jessica Sorrell},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stability Is Stable: Connections between Replicability, Privacy, and
Adaptive Generalization},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {520--527},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585246},
doi = {10.1145/3564246.3585246},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BunGHILPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-12921,
author = {Mark Bun and
Marco Gaboardi and
Max Hopkins and
Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Satchit Sivakumar and
Jessica Sorrell},
title = {Stability is Stable: Connections between Replicability, Privacy, and
Adaptive Generalization},
journal = {CoRR},
volume = {abs/2303.12921},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.12921},
doi = {10.48550/ARXIV.2303.12921},
eprinttype = {arXiv},
eprint = {2303.12921},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-12921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoKV23,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
title = {Mutual Empowerment between Circuit Obfuscation and Circuit Minimization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-079}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/079},
eprinttype = {ECCC},
eprint = {TR23-079},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnGIJKN22,
author = {Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin K{\"{u}}nnemann and
Maria Paula Parga Nina},
title = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3156--3191},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01014-x},
doi = {10.1007/S00453-022-01014-X},
timestamp = {Mon, 31 Oct 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AnGIJKN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoLPS22,
author = {Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Jessica Sorrell},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Reproducibility in learning},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {818--831},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519973},
doi = {10.1145/3519935.3519973},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08430,
author = {Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Jessica Sorrell},
title = {Reproducibility in Learning},
journal = {CoRR},
volume = {abs/2201.08430},
year = {2022},
url = {https://arxiv.org/abs/2201.08430},
eprinttype = {arXiv},
eprint = {2201.08430},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08430.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BussFI22,
author = {Sam Buss and
Noah Fleming and
Russell Impagliazzo},
title = {{TFNP} Characterizations of Proof Systems and Monotone Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-141}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/141},
eprinttype = {ECCC},
eprint = {TR22-141},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BussFI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMP22,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
title = {Lower bounds for Polynomial Calculus with extension variables over
finite fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-038}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/038},
eprinttype = {ECCC},
eprint = {TR22-038},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FlemingGIPRTW21,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
editor = {Valentine Kabanets},
title = {On the Power and Limitations of Branch and Cut},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {6:1--6:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.6},
doi = {10.4230/LIPICS.CCC.2021.6},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/FlemingGIPRTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldwasserIPS21,
author = {Shafi Goldwasser and
Russell Impagliazzo and
Toniann Pitassi and
Rahul Santhanam},
editor = {Valentine Kabanets},
title = {On the Pseudo-Deterministic Query Complexity of {NP} Search Problems},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.36},
doi = {10.4230/LIPICS.CCC.2021.36},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldwasserIPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasIKL21,
author = {Ilias Diakonikolas and
Russell Impagliazzo and
Daniel M. Kane and
Rex Lei and
Jessica Sorrell and
Christos Tzamos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Boosting in the Presence of Massart Noise},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1585--1644},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21d.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasIKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CarmosinoHIKK21,
author = {Marco Carmosino and
Kenneth Hoover and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Lifting for Constant-Depth Circuits and Applications to {MCSP}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {44:1--44:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.44},
doi = {10.4230/LIPICS.ICALP.2021.44},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CarmosinoHIKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ImpagliazzoM21,
author = {Russell Impagliazzo and
Sam McGuire},
editor = {James R. Lee},
title = {Comparing Computational Entropies Below Majority (Or: When Is the
Dense Model Theorem False?)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {2:1--2:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.2},
doi = {10.4230/LIPICS.ITCS.2021.2},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ImpagliazzoM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AnGIJKN21,
author = {Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin K{\"{u}}nnemann and
Maria Paula Parga Nina},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.3},
doi = {10.4230/LIPICS.IPEC.2021.3},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/AnGIJKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-05019,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
title = {On the Power and Limitations of Branch and Cut},
journal = {CoRR},
volume = {abs/2102.05019},
year = {2021},
url = {https://arxiv.org/abs/2102.05019},
eprinttype = {arXiv},
eprint = {2102.05019},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-05019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-07779,
author = {Ilias Diakonikolas and
Russell Impagliazzo and
Daniel Kane and
Rex Lei and
Jessica Sorrell and
Christos Tzamos},
title = {Boosting in the Presence of Massart Noise},
journal = {CoRR},
volume = {abs/2106.07779},
year = {2021},
url = {https://arxiv.org/abs/2106.07779},
eprinttype = {arXiv},
eprint = {2106.07779},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-07779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingGIPRTW21,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
title = {On the Power and Limitations of Branch and Cut},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-012}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/012},
eprinttype = {ECCC},
eprint = {TR21-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingGIPRTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImpagliazzoMP20,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
editor = {Holger Hermanns and
Lijun Zhang and
Naoki Kobayashi and
Dale Miller},
title = {The Surprising Power of Constant Depth Algebraic Proofs},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {591--603},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3373718.3394754},
doi = {10.1145/3373718.3394754},
timestamp = {Sat, 30 Sep 2023 09:52:07 +0200},
biburl = {https://dblp.org/rec/conf/lics/ImpagliazzoMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-06166,
author = {Russell Impagliazzo and
Sam McGuire},
title = {Comparing computational entropies below majority (or: When is the
dense model theorem false?)},
journal = {CoRR},
volume = {abs/2011.06166},
year = {2020},
url = {https://arxiv.org/abs/2011.06166},
eprinttype = {arXiv},
eprint = {2011.06166},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-06166.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoM20,
author = {Russell Impagliazzo and
Sam McGuire},
title = {Comparing computational entropies below majority (or: When is the
dense model theorem false?)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-171}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/171},
eprinttype = {ECCC},
eprint = {TR20-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ImpagliazzoMZ19,
author = {Russell Impagliazzo and
Raghu Meka and
David Zuckerman},
title = {Pseudorandomness from Shrinkage},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {11:1--11:16},
year = {2019},
url = {https://doi.org/10.1145/3230630},
doi = {10.1145/3230630},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ImpagliazzoMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaoIKW19,
author = {Jiawei Gao and
Russell Impagliazzo and
Antonina Kolokolova and
Ryan Williams},
title = {Completeness for First-order Properties on Sparse Structures with
Algorithmic Applications},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {23:1--23:35},
year = {2019},
url = {https://doi.org/10.1145/3196275},
doi = {10.1145/3196275},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GaoIKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolovnevIIKKT19,
author = {Alexander Golovnev and
Rahul Ilango and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova and
Avishay Tal},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {AC\({}^{\mbox{0}}\)[p] Lower Bounds Against {MCSP} via the Coin Problem},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {66:1--66:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.66},
doi = {10.4230/LIPICS.ICALP.2019.66},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GolovnevIIKKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DhayalI19,
author = {Anant Dhayal and
Russell Impagliazzo},
title = {{UTIME} Easy-witness Lemma {\&} Some Consequences},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-167}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/167},
eprinttype = {ECCC},
eprint = {TR19-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DhayalI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GaoI19,
author = {Jiawei Gao and
Russell Impagliazzo},
title = {The Fine-Grained Complexity of Strengthenings of First-Order Logic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-009}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/009},
eprinttype = {ECCC},
eprint = {TR19-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GaoI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolovnevIIKKT19,
author = {Alexander Golovnev and
Rahul Ilango and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova and
Avishay Tal},
title = {AC0[p] Lower Bounds against {MCSP} via the Coin Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-018}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/018},
eprinttype = {ECCC},
eprint = {TR19-018},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GolovnevIIKKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMP19,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
title = {The Surprising Power of Constant Depth Algebraic Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-024}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/024},
eprinttype = {ECCC},
eprint = {TR19-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoKV18,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
editor = {Rocco A. Servedio},
title = {The Power of Natural Properties as Oracles},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.7},
doi = {10.4230/LIPICS.CCC.2018.7},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoKV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CarmosinoILM18,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Shachar Lovett and
Ivan Mihajlin},
editor = {Rocco A. Servedio},
title = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.12},
doi = {10.4230/LIPICS.CCC.2018.12},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CarmosinoILM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CarmosinoIS18,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Manuel Sabin},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Fine-Grained Derandomization: From Problem-Centric to Resource-Centric
Complexity},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.27},
doi = {10.4230/LIPICS.ICALP.2018.27},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CarmosinoIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeameFIKPPR18,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Anna R. Karlin},
title = {Stabbing Planes},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {10:1--10:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.10},
doi = {10.4230/LIPICS.ITCS.2018.10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeameFIKPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HooverIMS18,
author = {Kenneth Hoover and
Russell Impagliazzo and
Ivan Mihajlin and
Alexander V. Smal},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Half-Duplex Communication Complexity},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {10:1--10:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.10},
doi = {10.4230/LIPICS.ISAAC.2018.10},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HooverIMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoILM18,
author = {Marco Carmosino and
Russell Impagliazzo and
Shachar Lovett and
Ivan Mihajlin},
title = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-095}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/095},
eprinttype = {ECCC},
eprint = {TR18-095},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoILM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoIS18,
author = {Marco Carmosino and
Russell Impagliazzo and
Manuel Sabin},
title = {Fine-Grained Derandomization: From Problem-Centric to Resource-Centric
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-092}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/092},
eprinttype = {ECCC},
eprint = {TR18-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HooverIMS18,
author = {Kenneth Hoover and
Russell Impagliazzo and
Ivan Mihajlin and
Alexander Smal},
title = {Half-duplex communication complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-089}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/089},
eprinttype = {ECCC},
eprint = {TR18-089},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HooverIMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoK17,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {275--321},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0134-y},
doi = {10.1007/S00037-016-0134-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CarmosinoIKK17,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Agnostic Learning from Tolerant Natural Proofs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {35:1--35:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.35},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.35},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CarmosinoIKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ImpagliazzoKKMR17,
author = {Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova and
Pierre McKenzie and
Shadab Romani},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Does Looking Inside a Circuit Help?},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {1:1--1:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.1},
doi = {10.4230/LIPICS.MFCS.2017.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ImpagliazzoKKMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GaoIKW17,
author = {Jiawei Gao and
Russell Impagliazzo and
Antonina Kolokolova and
R. Ryan Williams},
editor = {Philip N. Klein},
title = {Completeness for First-Order Properties on Sparse Structures with
Algorithmic Applications},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2162--2181},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.141},
doi = {10.1137/1.9781611974782.141},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GaoIKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03219,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {CoRR},
volume = {abs/1710.03219},
year = {2017},
url = {http://arxiv.org/abs/1710.03219},
eprinttype = {arXiv},
eprint = {1710.03219},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03219.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameFIKPPR17,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-151}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/151},
eprinttype = {ECCC},
eprint = {TR17-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameFIKPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoKKMR17,
author = {Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova and
Pierre McKenzie and
Shadab Romani},
title = {Does Looking Inside a Circuit Help?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-109}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/109},
eprinttype = {ECCC},
eprint = {TR17-109},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoKKMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoKV17,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
title = {The Power of Natural Properties as Oracles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-023}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/023},
eprinttype = {ECCC},
eprint = {TR17-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameBI16,
author = {Paul Beame and
Chris Beck and
Russell Impagliazzo},
title = {Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds
for Superlinear Space},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1612--1645},
year = {2016},
url = {https://doi.org/10.1137/130914085},
doi = {10.1137/130914085},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeameBI16.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}
}
@inproceedings{DBLP:conf/coco/CarmosinoIKK16,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Ran Raz},
title = {Learning Algorithms from Natural Proofs},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {10:1--10:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.10},
doi = {10.4230/LIPICS.CCC.2016.10},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CarmosinoIKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CarmosinoGIMPS16,
author = {Marco L. Carmosino and
Jiawei Gao and
Russell Impagliazzo and
Ivan Mihajlin and
Ramamohan Paturi and
Stefan Schneider},
editor = {Madhu Sudan},
title = {Nondeterministic Extensions of the Strong Exponential Time Hypothesis
and Consequences for Non-reducibility},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {261--270},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840746},
doi = {10.1145/2840728.2840746},
timestamp = {Tue, 14 Jun 2022 13:12:41 +0200},
biburl = {https://dblp.org/rec/conf/innovations/CarmosinoGIMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/ImpagliazzoJKKK16,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets and
Bruce M. Kapron and
Valerie King and
Stefano Tessaro},
editor = {Martin Hirt and
Adam D. Smith},
title = {Simultaneous Secrecy and Reliability Amplification for a General Channel
Model},
booktitle = {Theory of Cryptography - 14th International Conference, {TCC} 2016-B,
Beijing, China, October 31 - November 3, 2016, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9985},
pages = {235--261},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53641-4\_10},
doi = {10.1007/978-3-662-53641-4\_10},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/ImpagliazzoJKKK16.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}
}
@article{DBLP:journals/eccc/CarmosinoIKK16,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
title = {Algorithms from Natural Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-008}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/008},
eprinttype = {ECCC},
eprint = {TR16-008},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoIKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GaoI16,
author = {Jiawei Gao and
Russell Impagliazzo},
title = {Orthogonal Vectors is hard for first-order properties on sparse graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-053}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/053},
eprinttype = {ECCC},
eprint = {TR16-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GaoI16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ImpagliazzoJKKK16,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets and
Bruce M. Kapron and
Valerie King and
Stefano Tessaro},
title = {Simultaneous Secrecy and Reliability Amplification for a General Channel
Model},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {760},
year = {2016},
url = {http://eprint.iacr.org/2016/760},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ImpagliazzoJKKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CarmosinoIKK15,
author = {Marco Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Tighter Connections between Derandomization and Circuit Lower Bounds},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {645--658},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.645},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.645},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CarmosinoIKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoGIMPS15,
author = {Marco Carmosino and
Jiawei Gao and
Russell Impagliazzo and
Ivan Mihajlin and
Ramamohan Paturi and
Stefan Schneider},
title = {Nondeterministic extensions of the Strong Exponential Time Hypothesis
and consequences for non-reducibility},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-148}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/148},
eprinttype = {ECCC},
eprint = {TR15-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoGIMPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ImpagliazzoMR14,
author = {Russell Impagliazzo and
Cristopher Moore and
Alexander Russell},
title = {An Entropic Proof of Chang's Inequality},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {173--176},
year = {2014},
url = {https://doi.org/10.1137/120877982},
doi = {10.1137/120877982},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ImpagliazzoMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonIM14,
author = {Scott Aaronson and
Russell Impagliazzo and
Dana Moshkovitz},
title = {{AM} with Multiple Merlins},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {44--55},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.13},
doi = {10.1109/CCC.2014.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AaronsonIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoK14,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {321--332},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.39},
doi = {10.1109/CCC.2014.39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ImpagliazzoLPS14,
author = {Russell Impagliazzo and
Shachar Lovett and
Ramamohan Paturi and
Stefan Schneider},
title = {0-1 Integer Linear Programming with a Linear Number of Constraints},
journal = {CoRR},
volume = {abs/1401.5512},
year = {2014},
url = {http://arxiv.org/abs/1401.5512},
eprinttype = {arXiv},
eprint = {1401.5512},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ImpagliazzoLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AaronsonIM14,
author = {Scott Aaronson and
Russell Impagliazzo and
Dana Moshkovitz},
title = {{AM} with Multiple Merlins},
journal = {CoRR},
volume = {abs/1401.6848},
year = {2014},
url = {http://arxiv.org/abs/1401.6848},
eprinttype = {arXiv},
eprint = {1401.6848},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AaronsonIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonIM14,
author = {Scott Aaronson and
Russell Impagliazzo and
Dana Moshkovitz},
title = {{AM} with Multiple Merlins},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-012}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/012},
eprinttype = {ECCC},
eprint = {TR14-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoLPS14,
author = {Russell Impagliazzo and
Shachar Lovett and
Ramamohan Paturi and
Stefan Schneider},
title = {0-1 Integer Linear Programming with a Linear Number of Constraints},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-024}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/024},
eprinttype = {ECCC},
eprint = {TR14-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalabroIP13,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
title = {On the Exact Complexity of Evaluating Quantified \emph{k} -CNF},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {817--827},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9648-0},
doi = {10.1007/S00453-012-9648-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CalabroIP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BatmanIMP13,
author = {Lucia Batman and
Russell Impagliazzo and
Cody Murray and
Ramamohan Paturi},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Finding Heavy Hitters from Lossy or Noisy Data},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {347--362},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_25},
doi = {10.1007/978-3-642-40328-6\_25},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BatmanIMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoPS13,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Stefan Schneider},
title = {A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {479--488},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.58},
doi = {10.1109/FOCS.2013.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ImpagliazzoP13,
author = {Russell Impagliazzo and
Ramamohan Paturi},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Exact Complexity and Satisfiability - (Invited Talk)},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {1--3},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_1},
doi = {10.1007/978-3-319-03898-8\_1},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ImpagliazzoP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeckI13,
author = {Christopher Beck and
Russell Impagliazzo},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Strong {ETH} holds for regular resolution},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {487--494},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488669},
doi = {10.1145/2488608.2488669},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeckI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoK13,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-163}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/163},
eprinttype = {ECCC},
eprint = {TR13-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarakGIRSVY12,
author = {Boaz Barak and
Oded Goldreich and
Russell Impagliazzo and
Steven Rudich and
Amit Sahai and
Salil P. Vadhan and
Ke Yang},
title = {On the (im)possibility of obfuscating programs},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {6:1--6:48},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160159},
doi = {10.1145/2160158.2160159},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarakGIRSVY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoKW12,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {New Direct-Product Testers and 2-Query PCPs},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {6},
pages = {1722--1768},
year = {2012},
url = {https://doi.org/10.1137/09077299X},
doi = {10.1137/09077299X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoKW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIS12,
author = {Paul Beame and
Russell Impagliazzo and
Srikanth Srinivasan},
title = {Approximating AC{\^{}}0 by Small Height Decision Trees and a Deterministic
Algorithm for {\#}AC{\^{}}0SAT},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {117--125},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.40},
doi = {10.1109/CCC.2012.40},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeckIL12,
author = {Chris Beck and
Russell Impagliazzo and
Shachar Lovett},
title = {Large Deviation Bounds for Decision Trees and Sampling Lower Bounds
for AC0-Circuits},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {101--110},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.82},
doi = {10.1109/FOCS.2012.82},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeckIL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoMZ12,
author = {Russell Impagliazzo and
Raghu Meka and
David Zuckerman},
title = {Pseudorandomness from Shrinkage},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {111--119},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.78},
doi = {10.1109/FOCS.2012.78},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ImpagliazzoMP12,
author = {Russell Impagliazzo and
William Matthews and
Ramamohan Paturi},
editor = {Yuval Rabani},
title = {A satisfiability algorithm for AC\({}^{\mbox{0}}\)},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {961--972},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.77},
doi = {10.1137/1.9781611973099.77},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/ImpagliazzoMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameBI12,
author = {Paul Beame and
Christopher Beck and
Russell Impagliazzo},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Time-space tradeoffs in resolution: superpolynomial lower bounds for
superlinear space},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {213--232},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2213999},
doi = {10.1145/2213977.2213999},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameBI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-0263,
author = {Russell Impagliazzo and
Cristopher Moore and
Alexander Russell},
title = {An Entropic Proof of Chang's Inequality},
journal = {CoRR},
volume = {abs/1205.0263},
year = {2012},
url = {http://arxiv.org/abs/1205.0263},
eprinttype = {arXiv},
eprint = {1205.0263},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-0263.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4548,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Stefan Schneider},
title = {A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits},
journal = {CoRR},
volume = {abs/1212.4548},
year = {2012},
url = {http://arxiv.org/abs/1212.4548},
eprinttype = {arXiv},
eprint = {1212.4548},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-4548.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeckIL12,
author = {Chris Beck and
Russell Impagliazzo and
Shachar Lovett},
title = {Large Deviation Bounds for Decision Trees and Sampling Lower Bounds
for AC0-circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-042}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/042},
eprinttype = {ECCC},
eprint = {TR12-042},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeckIL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMZ12,
author = {Russell Impagliazzo and
Raghu Meka and
David Zuckerman},
title = {Pseudorandomness from Shrinkage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-057}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/057},
eprinttype = {ECCC},
eprint = {TR12-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Buresh-OppenheimDI11,
author = {Joshua Buresh{-}Oppenheim and
Sashka Davis and
Russell Impagliazzo},
title = {A Stronger Model of Dynamic Programming Algorithms},
journal = {Algorithmica},
volume = {60},
number = {4},
pages = {938--968},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9385-1},
doi = {10.1007/S00453-009-9385-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Buresh-OppenheimDI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichBBIMP11,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {679--740},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0028-y},
doi = {10.1007/S00037-011-0028-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichBBIMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Impagliazzo11,
author = {Russell Impagliazzo},
title = {Relativized Separations of Worst-Case and Average-Case Complexities
for {NP}},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {104--114},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.34},
doi = {10.1109/CCC.2011.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Impagliazzo11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3127,
author = {Russell Impagliazzo and
William Matthews and
Ramamohan Paturi},
title = {A Satisfiability Algorithm for AC{\textdollar}{\^{}}0{\textdollar}},
journal = {CoRR},
volume = {abs/1107.3127},
year = {2011},
url = {http://arxiv.org/abs/1107.3127},
eprinttype = {arXiv},
eprint = {1107.3127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameBI11,
author = {Paul Beame and
Chris Beck and
Russell Impagliazzo},
title = {Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for
Superlinear Space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-149}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/149},
eprinttype = {ECCC},
eprint = {TR11-149},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameBI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-SassonI10,
author = {Eli Ben{-}Sasson and
Russell Impagliazzo},
title = {Random Cnf's are Hard for the Polynomial Calculus},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {501--519},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0293-1},
doi = {10.1007/S00037-010-0293-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ben-SassonI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoJKW10,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets and
Avi Wigderson},
title = {Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1637--1665},
year = {2010},
url = {https://doi.org/10.1137/080734030},
doi = {10.1137/080734030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoJKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeameIPS10,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Formula Caching in {DPLL}},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {3},
pages = {9:1--9:33},
year = {2010},
url = {https://doi.org/10.1145/1714450.1714452},
doi = {10.1145/1714450.1714452},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BeameIPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ImpagliazzoK10,
author = {Russell Impagliazzo and
Valentine Kabanets},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Constructive Proofs of Concentration Bounds},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {617--631},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_46},
doi = {10.1007/978-3-642-15369-3\_46},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ImpagliazzoK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoW10,
author = {Russell Impagliazzo and
Ryan Williams},
title = {Communication Complexity with Synchronized Clocks},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {259--269},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.32},
doi = {10.1109/CCC.2010.32},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CalabroIP10,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {On the Exact Complexity of Evaluating Quantified \emph{k}-CNF},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {50--59},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_7},
doi = {10.1007/978-3-642-17493-3\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CalabroIP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AroraIMS10,
author = {Sanjeev Arora and
Russell Impagliazzo and
William Matthews and
David Steurer},
title = {Improved Algorithms for Unique Games via Divide and Conquer},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-041}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/041},
eprinttype = {ECCC},
eprint = {TR10-041},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AroraIMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoK10,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Constructive Proofs of Concentration Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-072}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/072},
eprinttype = {ECCC},
eprint = {TR10-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DavisI09,
author = {Sashka Davis and
Russell Impagliazzo},
title = {Models of Greedy Algorithms for Graph Problems},
journal = {Algorithmica},
volume = {54},
number = {3},
pages = {269--317},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9124-4},
doi = {10.1007/S00453-007-9124-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DavisI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ImpagliazzoM09,
author = {Russell Impagliazzo and
Philippe Moser},
title = {A zero-one law for {RP} and derandomization of {AM} if {NP} is not
small},
journal = {Inf. Comput.},
volume = {207},
number = {7},
pages = {787--792},
year = {2009},
url = {https://doi.org/10.1016/j.ic.2009.02.002},
doi = {10.1016/J.IC.2009.02.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ImpagliazzoM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/ImpagliazzoJK09,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets},
title = {Chernoff-Type Direct Product Theorems},
journal = {J. Cryptol.},
volume = {22},
number = {1},
pages = {75--92},
year = {2009},
url = {https://doi.org/10.1007/s00145-008-9029-7},
doi = {10.1007/S00145-008-9029-7},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/ImpagliazzoJK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoJK09,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets},
title = {Approximate List-Decoding of Direct Product Codes and Uniform Hardness
Amplification},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {564--605},
year = {2009},
url = {https://doi.org/10.1137/070683994},
doi = {10.1137/070683994},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoJK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CalabroIP09,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {The Complexity of Satisfiability of Small Depth Circuits},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {75--85},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_6},
doi = {10.1007/978-3-642-11269-0\_6},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CalabroIP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoKW09,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
editor = {Michael Mitzenmacher},
title = {New direct-product testers and 2-query PCPs},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {131--140},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536435},
doi = {10.1145/1536414.1536435},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoKK09,
author = {Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Michael Mitzenmacher},
title = {An axiomatic approach to algebrization},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {695--704},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536509},
doi = {10.1145/1536414.1536509},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/DodisIJK09,
author = {Yevgeniy Dodis and
Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets},
editor = {Omer Reingold},
title = {Security Amplification for InteractiveCryptographic Primitives},
booktitle = {Theory of Cryptography, 6th Theory of Cryptography Conference, {TCC}
2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5444},
pages = {128--145},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00457-5\_9},
doi = {10.1007/978-3-642-00457-5\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/DodisIJK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/ImpagliazzoKK09,
author = {Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {An Axiomatic Approach to Algebrization},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2415/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/ImpagliazzoKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlekhnovichBBIM09,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-038}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/038},
eprinttype = {ECCC},
eprint = {TR09-038},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlekhnovichBBIM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoKW09,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {New Direct-Product Testers and 2-Query PCPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-090}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/090},
eprinttype = {ECCC},
eprint = {TR09-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FortnowIKU08,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {353--376},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0252-2},
doi = {10.1007/S00037-008-0252-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FortnowIKU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CalabroIKP08,
author = {Chris Calabro and
Russell Impagliazzo and
Valentine Kabanets and
Ramamohan Paturi},
title = {The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
pages = {386--393},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.015},
doi = {10.1016/J.JCSS.2007.06.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CalabroIKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoJKW08,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets and
Avi Wigderson},
editor = {Cynthia Dwork},
title = {Uniform direct product theorems: simplified, optimized, and derandomized},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {579--588},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374460},
doi = {10.1145/1374376.1374460},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoJKW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoJKW08,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets and
Avi Wigderson},
title = {Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-079}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-079/index.html},
eprinttype = {ECCC},
eprint = {TR08-079},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoJKW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameIS07,
author = {Paul Beame and
Russell Impagliazzo and
Ashish Sabharwal},
title = {The Resolution Complexity of Independent Sets and Vertex Covers in
Random Graphs},
journal = {Comput. Complex.},
volume = {16},
number = {3},
pages = {245--297},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0230-0},
doi = {10.1007/S00037-007-0230-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameIS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/ImpagliazzoJK07,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets},
editor = {Alfred Menezes},
title = {Chernoff-Type Direct Product Theorems},
booktitle = {Advances in Cryptology - {CRYPTO} 2007, 27th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4622},
pages = {500--516},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74143-5\_28},
doi = {10.1007/978-3-540-74143-5\_28},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/ImpagliazzoJK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ImpagliazzoSW06,
author = {Russell Impagliazzo and
Ronen Shaltiel and
Avi Wigderson},
title = {Reducing The Seed Length In The Nisan-Wigderson Generator},
journal = {Comb.},
volume = {26},
number = {6},
pages = {647--681},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0036-8},
doi = {10.1007/S00493-006-0036-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ImpagliazzoSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoK06,
author = {Russell Impagliazzo and
Bruce M. Kapron},
title = {Logics for reasoning about cryptographic constructions},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {2},
pages = {286--320},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.06.008},
doi = {10.1016/J.JCSS.2005.06.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakIW06,
author = {Boaz Barak and
Russell Impagliazzo and
Avi Wigderson},
title = {Extracting Randomness Using Few Independent Sources},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {4},
pages = {1095--1118},
year = {2006},
url = {https://doi.org/10.1137/S0097539705447141},
doi = {10.1137/S0097539705447141},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BarakIW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/ImpagliazzoS06,
author = {Russell Impagliazzo and
Nathan Segerlind},
title = {Constant-depth Frege systems with counting axioms polynomially simulate
Nullstellensatz refutations},
journal = {{ACM} Trans. Comput. Log.},
volume = {7},
number = {2},
pages = {199--218},
year = {2006},
url = {https://doi.org/10.1145/1131313.1131314},
doi = {10.1145/1131313.1131314},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/ImpagliazzoS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DavisEI06,
author = {Sashka Davis and
Jeff Edmonds and
Russell Impagliazzo},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Online Algorithms to Minimize Resource Reallocations and Network Communication},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {104--115},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_12},
doi = {10.1007/11830924\_12},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DavisEI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIP06,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
title = {A Duality between Clause Width and Clause Density for {SAT}},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {252--260},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.6},
doi = {10.1109/CCC.2006.6},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CalabroIP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoJK06,
author = {Russell Impagliazzo and
Ragesh Jaiswal and
Valentine Kabanets},
title = {Approximately List-Decoding Direct Product Codes and Uniform Hardness
Amplification},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.13},
doi = {10.1109/FOCS.2006.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoJK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Impagliazzo06,
author = {Russell Impagliazzo},
editor = {Jon M. Kleinberg},
title = {Can every randomized algorithm be derandomized?},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {373--374},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132571},
doi = {10.1145/1132516.1132571},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Impagliazzo06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameIPS06,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Formula Caching in {DPLL}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-140}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-140/index.html},
eprinttype = {ECCC},
eprint = {TR06-140},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameIPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NashIR06,
author = {Alan Nash and
Russell Impagliazzo and
Jeffrey B. Remmel},
title = {Infinitely-Often Universal Languages and Diagonalization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-051}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-051/index.html},
eprinttype = {ECCC},
eprint = {TR06-051},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NashIR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlekhnovichBBIMP05,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {308--322},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.32},
doi = {10.1109/CCC.2005.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlekhnovichBBIMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowIKU05,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {323--332},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.18},
doi = {10.1109/CCC.2005.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowIKU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Impagliazzo05,
author = {Russell Impagliazzo},
editor = {Ramaswamy Ramanujam and
Sandeep Sen},
title = {Computational Complexity Since 1980},
booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
Computer Science, 25th International Conference, Hyderabad, India,
December 15-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3821},
pages = {19--47},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11590156\_2},
doi = {10.1007/11590156\_2},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Impagliazzo05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-120,
author = {Sashka Davis and
Russell Impagliazzo},
title = {Models of Greedy Algorithms for Graph Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-120}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-120/index.html},
eprinttype = {ECCC},
eprint = {TR05-120},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-120.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KabanetsI04,
author = {Valentine Kabanets and
Russell Impagliazzo},
title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower
Bounds},
journal = {Comput. Complex.},
volume = {13},
number = {1-2},
pages = {1--46},
year = {2004},
url = {https://doi.org/10.1007/s00037-004-0182-6},
doi = {10.1007/S00037-004-0182-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KabanetsI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Ben-SassonIW04,
author = {Eli Ben{-}Sasson and
Russell Impagliazzo and
Avi Wigderson},
title = {Near Optimal Separation Of Tree-Like And General Resolution},
journal = {Comb.},
volume = {24},
number = {4},
pages = {585--603},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0036-5},
doi = {10.1007/S00493-004-0036-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Ben-SassonIW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SegerlindBI04,
author = {Nathan Segerlind and
Samuel R. Buss and
Russell Impagliazzo},
title = {A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF
Resolution},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {5},
pages = {1171--1200},
year = {2004},
url = {https://doi.org/10.1137/S0097539703428555},
doi = {10.1137/S0097539703428555},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SegerlindBI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakIW04,
author = {Boaz Barak and
Russell Impagliazzo and
Avi Wigderson},
title = {Extracting Randomness Using Few Independent Sources},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {384--393},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.29},
doi = {10.1109/FOCS.2004.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BarakIW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DavisI04,
author = {Sashka Davis and
Russell Impagliazzo},
editor = {J. Ian Munro},
title = {Models of greedy algorithms for graph problems},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {381--390},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982847},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DavisI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-001,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the complexity of succinct zero-sum games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-001}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-001/index.html},
eprinttype = {ECCC},
eprint = {TR04-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoM03,
author = {Russell Impagliazzo and
Philippe Moser},
title = {A zero one law for {RP}},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {48--52},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214409},
doi = {10.1109/CCC.2003.1214409},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIKP03,
author = {Chris Calabro and
Russell Impagliazzo and
Valentine Kabanets and
Ramamohan Paturi},
title = {The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {135},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214416},
doi = {10.1109/CCC.2003.1214416},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CalabroIKP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIPS03,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Memoization and {DPLL:} Formula Caching Proof Systems},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {248},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214425},
doi = {10.1109/CCC.2003.1214425},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NashIR03,
author = {Alan Nash and
Russell Impagliazzo and
Jeffrey B. Remmel},
title = {Universal Languages and the Power of Diagonalization},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {337--346},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214432},
doi = {10.1109/CCC.2003.1214432},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/NashIR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoK03,
author = {Russell Impagliazzo and
Bruce M. Kapron},
title = {Logics for Reasoning about Cryptographic Constructions},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {372--383},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238211},
doi = {10.1109/SFCS.2003.1238211},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KabanetsI03,
author = {Valentine Kabanets and
Russell Impagliazzo},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Derandomizing polynomial identity tests means proving circuit lower
bounds},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {355--364},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780595},
doi = {10.1145/780542.780595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KabanetsI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wpes/ImpagliazzoM03,
author = {Russell Impagliazzo and
Sara Miner More},
editor = {Sushil Jajodia and
Pierangela Samarati and
Paul F. Syverson},
title = {Anonymous credentials with biometrically-enforced non-transferability},
booktitle = {Proceedings of the 2003 {ACM} Workshop on Privacy in the Electronic
Society, {WPES} 2003, Washington, DC, USA, October 30, 2003},
pages = {60--71},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/1005140.1005150},
doi = {10.1145/1005140.1005150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wpes/ImpagliazzoM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0304040,
author = {Russell Impagliazzo},
title = {Hardness as randomness: a survey of universal derandomization},
journal = {CoRR},
volume = {cs.CC/0304040},
year = {2003},
url = {http://arxiv.org/abs/cs/0304040},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0304040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0308012,
author = {Russell Impagliazzo and
Nathan Segerlind},
title = {Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate
Nullstellensatz Refutations},
journal = {CoRR},
volume = {cs.CC/0308012},
year = {2003},
url = {http://arxiv.org/abs/cs/0308012},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0308012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Buresh-OppenheimCIP02,
author = {Josh Buresh{-}Oppenheim and
Matthew Clegg and
Russell Impagliazzo and
Toniann Pitassi},
title = {Homogenization and the polynomial calculus},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {91--108},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0171-6},
doi = {10.1007/S00037-002-0171-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Buresh-OppenheimCIP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoKW02,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {In search of an easy witness: exponential time vs. probabilistic polynomial
time},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {672--694},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00024-7},
doi = {10.1016/S0022-0000(02)00024-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/ImpagliazzoK02,
author = {Russell Impagliazzo and
Jan Kraj{\'{\i}}cek},
title = {A Note on Conservativity Relations among Bounded Arithmetic Theories},
journal = {Math. Log. Q.},
volume = {48},
number = {3},
pages = {375--377},
year = {2002},
url = {https://doi.org/10.1002/1521-3870(200204)48:3\&\#60;375::AID-MALQ375\&\#62;3.0.CO;2-L},
doi = {10.1002/1521-3870(200204)48:3\&\#60;375::AID-MALQ375\&\#62;3.0.CO;2-L},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/ImpagliazzoK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SegerlindBI02,
author = {Nathan Segerlind and
Samuel R. Buss and
Russell Impagliazzo},
title = {A Switching Lemma for Small Restrictions and Lower Bounds for k -
{DNF} Resolution},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {604},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181984},
doi = {10.1109/SFCS.2002.1181984},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SegerlindBI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ImpagliazzoS02,
author = {Russell Impagliazzo and
Nathan Segerlind},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate
Nullstellensatz Refutations},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {208--219},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_19},
doi = {10.1007/3-540-45465-9\_19},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ImpagliazzoS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-055,
author = {Valentine Kabanets and
Russell Impagliazzo},
title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower
Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-055}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-055/index.html},
eprinttype = {ECCC},
eprint = {TR02-055},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AgrawalAIPR01,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
title = {Reducing the complexity of reductions},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {117--138},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8191-1},
doi = {10.1007/S00037-001-8191-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AgrawalAIPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/EdmondsIRS01,
author = {Jeff Edmonds and
Russell Impagliazzo and
Steven Rudich and
Jir{\'{\i}} Sgall},
title = {Communication complexity towards lower bounds on circuit depth},
journal = {Comput. Complex.},
volume = {10},
number = {3},
pages = {210--246},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8195-x},
doi = {10.1007/S00037-001-8195-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/EdmondsIRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BussGIP01,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
title = {Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct
Primes},
journal = {J. Comput. Syst. Sci.},
volume = {62},
number = {2},
pages = {267--289},
year = {2001},
url = {https://doi.org/10.1006/jcss.2000.1726},
doi = {10.1006/JCSS.2000.1726},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BussGIP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoP01,
author = {Russell Impagliazzo and
Ramamohan Paturi},
title = {On the Complexity of k-SAT},
journal = {J. Comput. Syst. Sci.},
volume = {62},
number = {2},
pages = {367--375},
year = {2001},
url = {https://doi.org/10.1006/jcss.2000.1727},
doi = {10.1006/JCSS.2000.1727},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoPZ01,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Francis Zane},
title = {Which Problems Have Strongly Exponential Complexity?},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {4},
pages = {512--530},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1774},
doi = {10.1006/JCSS.2001.1774},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoPZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoW01,
author = {Russell Impagliazzo and
Avi Wigderson},
title = {Randomness vs Time: Derandomization under a Uniform Assumption},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {4},
pages = {672--688},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1780},
doi = {10.1006/JCSS.2001.1780},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoKW01,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial
Time},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933865},
doi = {10.1109/CCC.2001.933865},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoKW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIS01,
author = {Paul Beame and
Russell Impagliazzo and
Ashish Sabharwal},
title = {Resolution Complexity of Independent Sets in Random Graphs},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {52--68},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933872},
doi = {10.1109/CCC.2001.933872},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BarakGIRSVY01,
author = {Boaz Barak and
Oded Goldreich and
Russell Impagliazzo and
Steven Rudich and
Amit Sahai and
Salil P. Vadhan and
Ke Yang},
editor = {Joe Kilian},
title = {On the (Im)possibility of Obfuscating Programs},
booktitle = {Advances in Cryptology - {CRYPTO} 2001, 21st Annual International
Cryptology Conference, Santa Barbara, California, USA, August 19-23,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2139},
pages = {1--18},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44647-8\_1},
doi = {10.1007/3-540-44647-8\_1},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/crypto/BarakGIRSVY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoS01,
author = {Russell Impagliazzo and
Nathan Segerlind},
title = {Counting Axioms Do Not Polynomially Simulate Counting Gates},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {200--209},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959894},
doi = {10.1109/SFCS.2001.959894},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/Impagliazzo01,
author = {Russell Impagliazzo},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {2--5},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_2},
doi = {10.1007/3-540-44666-4\_2},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/Impagliazzo01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CarsonI01,
author = {Ted Carson and
Russell Impagliazzo},
editor = {S. Rao Kosaraju},
title = {Hill-climbing finds random planted bisections},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {903--909},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365805},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CarsonI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-057,
author = {Boaz Barak and
Oded Goldreich and
Russell Impagliazzo and
Steven Rudich and
Amit Sahai and
Salil P. Vadhan and
Ke Yang},
title = {On the (Im)possibility of Obfuscating Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-057}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-057/index.html},
eprinttype = {ECCC},
eprint = {TR01-057},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BarakGIRSVY01,
author = {Boaz Barak and
Oded Goldreich and
Russell Impagliazzo and
Steven Rudich and
Amit Sahai and
Salil P. Vadhan and
Ke Yang},
title = {On the (Im)possibility of Obfuscating Programs},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {69},
year = {2001},
url = {http://eprint.iacr.org/2001/069},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BarakGIRSVY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Buresh-OppenheimCIP00,
author = {Josh Buresh{-}Oppenheim and
Matthew Clegg and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Homogenization and the Polynominal Calculus},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {926--937},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_78},
doi = {10.1007/3-540-45022-X\_78},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Buresh-OppenheimCIP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PudlakI00,
author = {Pavel Pudl{\'{a}}k and
Russell Impagliazzo},
editor = {David B. Shmoys},
title = {A lower bound for {DLL} algorithms for \emph{k}-SAT (preliminary version)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {128--136},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338244},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/PudlakI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoSW00,
author = {Russell Impagliazzo and
Ronen Shaltiel and
Avi Wigderson},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Extractors and pseudo-random generators with optimal seed length},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {1--10},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335306},
doi = {10.1145/335305.335306},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-005,
author = {Eli Ben{-}Sasson and
Russell Impagliazzo and
Avi Wigderson},
title = {Near-Optimal Separation of Treelike and General Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-005}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-005/index.html},
eprinttype = {ECCC},
eprint = {TR00-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-009,
author = {Russell Impagliazzo and
Ronen Shaltiel and
Avi Wigderson},
title = {Extractors and pseudo-random generators with optimal seed length},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-009}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-009/index.html},
eprinttype = {ECCC},
eprint = {TR00-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoPS99,
author = {Russell Impagliazzo and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for the Polynomial Calculus and the Gr{\"{o}}bner
Basis Algorithm},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {127--144},
year = {1999},
url = {https://doi.org/10.1007/s000370050024},
doi = {10.1007/S000370050024},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HastadILL99,
author = {Johan H{\aa}stad and
Russell Impagliazzo and
Leonid A. Levin and
Michael Luby},
title = {A Pseudorandom Generator from any One-way Function},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {4},
pages = {1364--1396},
year = {1999},
url = {https://doi.org/10.1137/S0097539793244708},
doi = {10.1137/S0097539793244708},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HastadILL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussGIP99,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
title = {Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct
Primes (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {5},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766254},
doi = {10.1109/CCC.1999.766254},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BussGIP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoP99,
author = {Russell Impagliazzo and
Ramamohan Paturi},
title = {Complexity of k-SAT},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {237--240},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766282},
doi = {10.1109/CCC.1999.766282},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoSW99,
author = {Russell Impagliazzo and
Ronen Shaltiel and
Avi Wigderson},
title = {Near-Optimal Conversion of Hardness into Pseudo-Randomness},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {181--190},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814590},
doi = {10.1109/SFFCS.1999.814590},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-SassonI99,
author = {Eli Ben{-}Sasson and
Russell Impagliazzo},
title = {Random CNF's are Hard for the Polynomial Calculus},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {415--421},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814613},
doi = {10.1109/SFFCS.1999.814613},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-SassonI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CrescenzoFIJ99,
author = {Giovanni Di Crescenzo and
Niels Ferguson and
Russell Impagliazzo and
Markus Jakobsson},
editor = {Christoph Meinel and
Sophie Tison},
title = {How to Forget a Secret},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {500--509},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_47},
doi = {10.1007/3-540-49116-3\_47},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CrescenzoFIJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CrescenzoI99,
author = {Giovanni Di Crescenzo and
Russell Impagliazzo},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Security-Preserving Hardness-Amplification for Any Regular One-Way
Function},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {169--178},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301296},
doi = {10.1145/301250.301296},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CrescenzoI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BussGIP99,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct
Primes},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {547--556},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301399},
doi = {10.1145/301250.301399},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BussGIP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BellareI99,
author = {Mihir Bellare and
Russell Impagliazzo},
title = {A tool for obtaining tighter security analyses of pseudorandom function
based constructions, with applications to {PRP} to {PRF} conversion},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {24},
year = {1999},
url = {http://eprint.iacr.org/1999/024},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BellareI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameIP98,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi},
title = {Improved Depth Lower Bounds for Small Distance Connectivity},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {325--345},
year = {1998},
url = {https://doi.org/10.1007/s000370050014},
doi = {10.1007/S000370050014},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameIP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeameCEIP98,
author = {Paul Beame and
Stephen A. Cook and
Jeff Edmonds and
Russell Impagliazzo and
Toniann Pitassi},
title = {The Relative Complexity of {NP} Search Problems},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {1},
pages = {3--19},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1575},
doi = {10.1006/JCSS.1998.1575},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeameCEIP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CrescenzoI98,
author = {Giovanni Di Crescenzo and
Russell Impagliazzo},
title = {Proofs of Membership vs. Proofs of Knowledge},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {34--45},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694589},
doi = {10.1109/CCC.1998.694589},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CrescenzoI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoPZ98,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Francis Zane},
title = {Which Problems Have Strongly Exponential Complexity?},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {653--663},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743516},
doi = {10.1109/SFCS.1998.743516},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoPZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoW98,
author = {Russell Impagliazzo and
Avi Wigderson},
title = {Randomness vs. Time: De-Randomization under a Uniform Assumption},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {734--743},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743524},
doi = {10.1109/SFCS.1998.743524},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DimitriouI98,
author = {Tassos Dimitriou and
Russell Impagliazzo},
editor = {Howard J. Karloff},
title = {Go with the Winners for Graph Bisection},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {510--520},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314837},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/DimitriouI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BussIPRS97,
author = {Samuel R. Buss and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alexander A. Razborov and
Jir{\'{\i}} Sgall},
title = {Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems
with Modular Counting},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {256--298},
year = {1997},
url = {https://doi.org/10.1007/BF01294258},
doi = {10.1007/BF01294258},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BussIPRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CookIY97,
author = {Stephen A. Cook and
Russell Impagliazzo and
Tomoyuki Yamakami},
title = {A Tight Relationship Between Generic Oracles and Type-2 Complexity
Theory},
journal = {Inf. Comput.},
volume = {137},
number = {2},
pages = {159--170},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2646},
doi = {10.1006/INCO.1997.2646},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CookIY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoPS97,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Michael E. Saks},
title = {Size-Depth Tradeoffs for Threshold Circuits},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {3},
pages = {693--707},
year = {1997},
url = {https://doi.org/10.1137/S0097539792282965},
doi = {10.1137/S0097539792282965},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuptaI97,
author = {Arvind Gupta and
Russell Impagliazzo},
title = {Bounding the Size of Planar Intertwines},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {337--358},
year = {1997},
url = {https://doi.org/10.1137/S0895480192239931},
doi = {10.1137/S0895480192239931},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuptaI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BellareIN97,
author = {Mihir Bellare and
Russell Impagliazzo and
Moni Naor},
title = {Does Parallel Repetition Lower the Error in Computationally Sound
Protocols?},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {374--383},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646126},
doi = {10.1109/SFCS.1997.646126},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BellareIN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/Impagliazzo97,
author = {Russell Impagliazzo},
editor = {Jos{\'{e}} D. P. Rolim},
title = {Using Hard Problems to Derandomize Algorithms: An Incomplete Survey},
booktitle = {Randomization and Approximation Techniques in Computer Science, International
Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1269},
pages = {165--173},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63248-4\_14},
doi = {10.1007/3-540-63248-4\_14},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/Impagliazzo97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoW97,
author = {Russell Impagliazzo and
Avi Wigderson},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {\emph{P = BPP} if \emph{E} Requires Exponential Circuits: Derandomizing
the {XOR} Lemma},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {220--229},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258590},
doi = {10.1145/258533.258590},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalAIPR97,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Reducing the Complexity of Reductions},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {730--738},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258671},
doi = {10.1145/258533.258671},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalAIPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-042,
author = {Russell Impagliazzo and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-042}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-042/index.html},
eprinttype = {ECCC},
eprint = {TR97-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FichIKKK96,
author = {Faith E. Fich and
Russell Impagliazzo and
Bruce M. Kapron and
Valerie King and
Miroslaw Kutylowski},
title = {Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {104--111},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0052},
doi = {10.1006/JCSS.1996.0052},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FichIKKK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/ImpagliazzoN96,
author = {Russell Impagliazzo and
Moni Naor},
title = {Efficient Cryptographic Schemes Provably as Secure as Subset Sum},
journal = {J. Cryptol.},
volume = {9},
number = {4},
pages = {199--216},
year = {1996},
url = {https://doi.org/10.1007/BF00189260},
doi = {10.1007/BF00189260},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/ImpagliazzoN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/JakobssonSI96,
author = {Markus Jakobsson and
Kazue Sako and
Russell Impagliazzo},
editor = {Ueli M. Maurer},
title = {Designated Verifier Proofs and Their Applications},
booktitle = {Advances in Cryptology - {EUROCRYPT} '96, International Conference
on the Theory and Application of Cryptographic Techniques, Saragossa,
Spain, May 12-16, 1996, Proceeding},
series = {Lecture Notes in Computer Science},
volume = {1070},
pages = {143--154},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-68339-9\_13},
doi = {10.1007/3-540-68339-9\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/JakobssonSI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CleggEI96,
author = {Matthew Clegg and
Jeff Edmonds and
Russell Impagliazzo},
editor = {Gary L. Miller},
title = {Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {174--183},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237860},
doi = {10.1145/237814.237860},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CleggEI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DimitriouI96,
author = {Tassos Dimitriou and
Russell Impagliazzo},
editor = {Gary L. Miller},
title = {Towards an Analysis of Local Optimization Algorithms},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {304--313},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237882},
doi = {10.1145/237814.237882},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DimitriouI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClementiI95,
author = {Andrea Clementi and
Russell Impagliazzo},
title = {The Reachability Problem for Finite Cellular Automata},
journal = {Inf. Process. Lett.},
volume = {53},
number = {1},
pages = {27--31},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(94)00169-Y},
doi = {10.1016/0020-0190(94)00169-Y},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClementiI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Impagliazzo95,
author = {Russell Impagliazzo},
title = {A Personal View of Average-Case Complexity},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {134--147},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514853},
doi = {10.1109/SCT.1995.514853},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Impagliazzo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Impagliazzo95,
author = {Russell Impagliazzo},
title = {Hard-Core Distributions for Somewhat Hard Problems},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {538--545},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492584},
doi = {10.1109/SFCS.1995.492584},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Impagliazzo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameIP95,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi},
title = {Improved Depth Lower Vounds for Small Distance Connectivity},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {692--701},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492671},
doi = {10.1109/SFCS.1995.492671},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameIP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameCEIP95,
author = {Paul Beame and
Stephen A. Cook and
Jeff Edmonds and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {The relative complexity of {NP} search problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {303--314},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225147},
doi = {10.1145/225058.225147},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameCEIP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ClementiI94,
author = {Andrea Clementi and
Russell Impagliazzo},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Graph Theory and Interactive Protocols for Reachability Problems on
Finite Cellular Automata},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {73--90},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_8},
doi = {10.1007/3-540-57811-0\_8},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ClementiI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoRW94,
author = {Russell Impagliazzo and
Ran Raz and
Avi Wigderson},
title = {A Direct Product Theorem},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {88--96},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315814},
doi = {10.1109/SCT.1994.315814},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoRW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameIKPP94,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k},
title = {Lower Bound on Hilbert's Nullstellensatz and propositional proofs},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {794--806},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365714},
doi = {10.1109/SFCS.1994.365714},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameIKPP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImpagliazzoPU94,
author = {Russell Impagliazzo and
Toniann Pitassi and
Alasdair Urquhart},
title = {Upper and Lower Bounds for Tree-Like Cutting Planes Proofs},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {220--228},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316069},
doi = {10.1109/LICS.1994.316069},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ImpagliazzoPU94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoNW94,
author = {Russell Impagliazzo and
Noam Nisan and
Avi Wigderson},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Pseudorandomness for network algorithms},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {356--364},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195190},
doi = {10.1145/195058.195190},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoNW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PitassiBI93,
author = {Toniann Pitassi and
Paul Beame and
Russell Impagliazzo},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
journal = {Comput. Complex.},
volume = {3},
pages = {97--140},
year = {1993},
url = {https://doi.org/10.1007/BF01200117},
doi = {10.1007/BF01200117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PitassiBI93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FeldmanINNRS93,
author = {David Feldman and
Russell Impagliazzo and
Moni Naor and
Noam Nisan and
Steven Rudich and
Adi Shamir},
title = {On Dice and Coins: Models of Computation for Random Generation},
journal = {Inf. Comput.},
volume = {104},
number = {2},
pages = {159--174},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1028},
doi = {10.1006/INCO.1993.1028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FeldmanINNRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ImpagliazzoN93,
author = {Russell Impagliazzo and
Noam Nisan},
title = {The Effect of Random Restrictions on Formula Size},
journal = {Random Struct. Algorithms},
volume = {4},
number = {2},
pages = {121--134},
year = {1993},
url = {https://doi.org/10.1002/rsa.3240040202},
doi = {10.1002/RSA.3240040202},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ImpagliazzoN93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FichIKKK93,
author = {Faith E. Fich and
Russell Impagliazzo and
Bruce M. Kapron and
Valerie King and
Miroslaw Kutylowski},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {386--397},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_39},
doi = {10.1007/3-540-56503-5\_39},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FichIKKK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoPS93,
author = {Russell Impagliazzo and
Ramamohan Paturi and
Michael E. Saks},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Size-depth trade-offs for threshold circuits},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {541--550},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167233},
doi = {10.1145/167088.167233},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoPS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameIKPPW92,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k and
Alan R. Woods},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {200--220},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129733},
doi = {10.1145/129712.129733},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameIKPPW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EdmondsRIS91,
author = {Jeff Edmonds and
Steven Rudich and
Russell Impagliazzo and
Jir{\'{\i}} Sgall},
title = {Communication Complexity Towards Lower Bounds on Circuit Depth},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {249--257},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185375},
doi = {10.1109/SFCS.1991.185375},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EdmondsRIS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaI91,
author = {Arvind Gupta and
Russell Impagliazzo},
title = {Computing Planar Intertwines},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {802--811},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185452},
doi = {10.1109/SFCS.1991.185452},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuptaI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldreichILVZ90,
author = {Oded Goldreich and
Russell Impagliazzo and
Leonid A. Levin and
Ramarathnam Venkatesan and
David Zuckerman},
title = {Security Preserving Amplification of Hardness},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {318--326},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89550},
doi = {10.1109/FSCS.1990.89550},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldreichILVZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoL90,
author = {Russell Impagliazzo and
Leonid A. Levin},
title = {No Better Ways to Generate Hard {NP} Instances than Picking Uniformly
at Random},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {II}},
pages = {812--821},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89604},
doi = {10.1109/FSCS.1990.89604},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoT89,
author = {Russell Impagliazzo and
G{\'{a}}bor Tardos},
title = {Decision Versus Search Problems in Super-Polynomial Time},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {222--227},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63482},
doi = {10.1109/SFCS.1989.63482},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoL89,
author = {Russell Impagliazzo and
Michael Luby},
title = {One-way Functions are Essential for Complexity Based Cryptography
(Extended Abstract)},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {230--235},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63483},
doi = {10.1109/SFCS.1989.63483},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoN89,
author = {Russell Impagliazzo and
Moni Naor},
title = {Efficient Cryptographic Schemes Provably as Secure as Subset Sum},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {236--241},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63484},
doi = {10.1109/SFCS.1989.63484},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoN89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoZ89,
author = {Russell Impagliazzo and
David Zuckerman},
title = {How to Recycle Random Bits},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {248--253},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63486},
doi = {10.1109/SFCS.1989.63486},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImpagliazzoZ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmanINNRS89,
author = {David Feldman and
Russell Impagliazzo and
Moni Naor and
Noam Nisan and
Steven Rudich and
Adi Shamir},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {On Dice and Coins: Models of Computation for Random Generation},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {319--340},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035769},
doi = {10.1007/BFB0035769},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FeldmanINNRS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoLL89,
author = {Russell Impagliazzo and
Leonid A. Levin and
Michael Luby},
editor = {David S. Johnson},
title = {Pseudo-random Generation from one-way functions (Extended Abstracts)},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {12--24},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73009},
doi = {10.1145/73007.73009},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoLL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoR89,
author = {Russell Impagliazzo and
Steven Rudich},
editor = {David S. Johnson},
title = {Limits on the Provable Consequences of One-Way Permutations},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {44--61},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73012},
doi = {10.1145/73007.73012},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoN88,
author = {Russell Impagliazzo and
Moni Naor},
title = {Decision trees and downward closures},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
Georgetown University, Washington, D. C., USA, June 14-17, 1988},
pages = {29--38},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SCT.1988.5260},
doi = {10.1109/SCT.1988.5260},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoN88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/ImpagliazzoR88,
author = {Russell Impagliazzo and
Steven Rudich},
editor = {Shafi Goldwasser},
title = {Limits on the Provable Consequences of One-way Permutations},
booktitle = {Advances in Cryptology - {CRYPTO} '88, 8th Annual International Cryptology
Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {403},
pages = {8--26},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/0-387-34799-2\_2},
doi = {10.1007/0-387-34799-2\_2},
timestamp = {Fri, 17 Jul 2020 16:12:45 +0200},
biburl = {https://dblp.org/rec/conf/crypto/ImpagliazzoR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/ImpagliazzoY87,
author = {Russell Impagliazzo and
Moti Yung},
editor = {Carl Pomerance},
title = {Direct Minimum-Knowledge Computations},
booktitle = {Advances in Cryptology - {CRYPTO} '87, {A} Conference on the Theory
and Applications of Cryptographic Techniques, Santa Barbara, California,
USA, August 16-20, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {293},
pages = {40--51},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-48184-2\_4},
doi = {10.1007/3-540-48184-2\_4},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/ImpagliazzoY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumI87,
author = {Manuel Blum and
Russell Impagliazzo},
title = {Generic Oracles and Oracle Classes (Extended Abstract)},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {118--126},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.30},
doi = {10.1109/SFCS.1987.30},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BlumI87.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-25 02:15 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:
