Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Valentine Kabanets
@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/GoldbergK23, author = {Halley Goldberg and Valentine Kabanets}, editor = {Amnon Ta{-}Shma}, title = {Improved Learning from Kolmogorov Complexity}, booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20, 2023, Warwick, {UK}}, series = {LIPIcs}, volume = {264}, pages = {12:1--12:29}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.CCC.2023.12}, doi = {10.4230/LIPICS.CCC.2023.12}, timestamp = {Mon, 10 Jul 2023 17:09:42 +0200}, biburl = {https://dblp.org/rec/conf/coco/GoldbergK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldbergK23, author = {Halley Goldberg and Valentine Kabanets}, title = {Improved Learning from Kolmogorov Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-080}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/080}, eprinttype = {ECCC}, eprint = {TR23-080}, timestamp = {Tue, 13 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldbergK23.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} }
@inproceedings{DBLP:conf/coco/GoldbergKLO22, author = {Halley Goldberg and Valentine Kabanets and Zhenjian Lu and Igor C. Oliveira}, editor = {Shachar Lovett}, title = {Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity}, booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23, 2022, Philadelphia, PA, {USA}}, series = {LIPIcs}, volume = {234}, pages = {16:1--16:60}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.CCC.2022.16}, doi = {10.4230/LIPICS.CCC.2022.16}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/GoldbergKLO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/BlaserKST22, author = {Markus Bl{\"{a}}ser and Valentine Kabanets and Ronen Shaltiel and Jacobo Tor{\'{a}}n}, title = {Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)}, journal = {Dagstuhl Reports}, volume = {12}, number = {9}, pages = {41--59}, year = {2022}, url = {https://doi.org/10.4230/DagRep.12.9.41}, doi = {10.4230/DAGREP.12.9.41}, timestamp = {Mon, 17 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BlaserKST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldbergK22, author = {Halley Goldberg and Valentine Kabanets}, title = {A Simpler Proof of the Worst-Case to Average-Case Reduction for Polynomial Hierarchy via Symmetry of Information}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-007}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/007}, eprinttype = {ECCC}, eprint = {TR22-007}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/GoldbergK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldbergKLO22, author = {Halley Goldberg and Valentine Kabanets and Zhenjian Lu and Igor C. Oliveira}, title = {Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-072}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/072}, eprinttype = {ECCC}, eprint = {TR22-072}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldbergKLO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/KabanetsKLMO21, author = {Valentine Kabanets and Sajin Koroth and Zhenjian Lu and Dimitrios Myrisiotis and Igor C. Oliveira}, title = {Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates}, journal = {{ACM} Trans. Comput. Theory}, volume = {13}, number = {4}, pages = {23:1--23:37}, year = {2021}, url = {https://doi.org/10.1145/3470861}, doi = {10.1145/3470861}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/KabanetsKLMO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/CarmosinoKKO21, author = {Marco Carmosino and Valentine Kabanets and Antonina Kolokolova and Igor C. Oliveira}, title = {LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic}, booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2021, Denver, CO, USA, February 7-10, 2022}, pages = {770--780}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/FOCS52979.2021.00080}, doi = {10.1109/FOCS52979.2021.00080}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/CarmosinoKKO21.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} }
@proceedings{DBLP:conf/coco/2021, editor = {Valentine Kabanets}, title = {36th Computational Complexity Conference, {CCC} 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)}, series = {LIPIcs}, volume = {200}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-193-1}, isbn = {978-3-95977-193-1}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CarmosinoKKO21, author = {Marco Carmosino and Valentine Kabanets and Antonina Kolokolova and Igor C. Oliveira}, title = {LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-095}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/095}, eprinttype = {ECCC}, eprint = {TR21-095}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CarmosinoKKO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/BussKKK20, author = {Sam Buss and Valentine Kabanets and Antonina Kolokolova and Michal Kouck{\'{y}}}, title = {Expander construction in VNC\({}^{\mbox{1}}\)}, journal = {Ann. Pure Appl. Log.}, volume = {171}, number = {7}, pages = {102796}, year = {2020}, url = {https://doi.org/10.1016/j.apal.2020.102796}, doi = {10.1016/J.APAL.2020.102796}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/BussKKK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KabanetsRS20, author = {Valentine Kabanets and Sofya Raskhodnikova and Chaitanya Swamy}, title = {Special Section on the Fifty-Eighth Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2017)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/20N975099}, doi = {10.1137/20N975099}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KabanetsRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/CheraghchiKLM20, author = {Mahdi Cheraghchi and Valentine Kabanets and Zhenjian Lu and Dimitrios Myrisiotis}, title = {Circuit Lower Bounds for {MCSP} from Local Pseudorandom Generators}, journal = {{ACM} Trans. Comput. Theory}, volume = {12}, number = {3}, pages = {21:1--21:27}, year = {2020}, url = {https://doi.org/10.1145/3404860}, doi = {10.1145/3404860}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/CheraghchiKLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KabanetsKLMO20, author = {Valentine Kabanets and Sajin Koroth and Zhenjian Lu and Dimitrios Myrisiotis and Igor C. Oliveira}, editor = {Shubhangi Saraf}, title = {Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates}, booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {169}, pages = {15:1--15:41}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CCC.2020.15}, doi = {10.4230/LIPICS.CCC.2020.15}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/KabanetsKLMO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-08533, author = {Valentine Kabanets and Sajin Koroth and Zhenjian Lu and Dimitrios Myrisiotis and Igor C. Oliveira}, title = {Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates}, journal = {CoRR}, volume = {abs/2002.08533}, year = {2020}, url = {https://arxiv.org/abs/2002.08533}, eprinttype = {arXiv}, eprint = {2002.08533}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-08533.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KabanetsKLMO20, author = {Valentine Kabanets and Sajin Koroth and Zhenjian Lu and Dimitrios Myrisiotis and Igor C. Oliveira}, title = {Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-018}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/018}, eprinttype = {ECCC}, eprint = {TR20-018}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsKLMO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CheraghchiKLM19, author = {Mahdi Cheraghchi and Valentine Kabanets and Zhenjian Lu and Dimitrios Myrisiotis}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {Circuit Lower Bounds for {MCSP} from Local Pseudorandom Generators}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {39:1--39:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.39}, doi = {10.4230/LIPICS.ICALP.2019.39}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CheraghchiKLM19.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 = {Mon, 08 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GolovnevIIKKT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CheraghchiKLM19, author = {Mahdi Cheraghchi and Valentine Kabanets and Zhenjian Lu and Dimitrios Myrisiotis}, title = {Circuit Lower Bounds for {MCSP} from Local Pseudorandom Generators}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-022}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/022}, eprinttype = {ECCC}, eprint = {TR19-022}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CheraghchiKLM19.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} }
@inproceedings{DBLP:conf/approx/KabanetsL18, author = {Valentine Kabanets and Zhenjian Lu}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {Satisfiability and Derandomization for Small Polynomial Threshold Circuits}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {46:1--46:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.46}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.46}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/KabanetsL18.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} }
@article{DBLP:journals/dagstuhl-reports/BlaserKTU18, author = {Markus Bl{\"{a}}ser and Valentine Kabanets and Jacobo Tor{\'{a}}n and Christopher Umans}, title = {Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391)}, journal = {Dagstuhl Reports}, volume = {8}, number = {9}, pages = {133--153}, year = {2018}, url = {https://doi.org/10.4230/DagRep.8.9.133}, doi = {10.4230/DAGREP.8.9.133}, timestamp = {Mon, 25 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BlaserKTU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KabanetsL18, author = {Valentine Kabanets and Zhenjian Lu}, title = {Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-012}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/012}, eprinttype = {ECCC}, eprint = {TR18-012}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KabanetsL18a, author = {Valentine Kabanets and Zhenjian Lu}, title = {Satisfiability and Derandomization for Small Polynomial Threshold Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-115}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/115}, eprinttype = {ECCC}, eprint = {TR18-115}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsL18a.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} }
@article{DBLP:journals/cc/AllenderHK17, author = {Eric Allender and Dhiraj Holden and Valentine Kabanets}, title = {The Minimum Oracle Circuit Size Problem}, journal = {Comput. Complex.}, volume = {26}, number = {2}, pages = {469--496}, year = {2017}, url = {https://doi.org/10.1007/s00037-016-0124-0}, doi = {10.1007/S00037-016-0124-0}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/AllenderHK17.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/innovations/BussKKK17, author = {Sam Buss and Valentine Kabanets and Antonina Kolokolova and Michal Kouck{\'{y}}}, editor = {Christos H. Papadimitriou}, title = {Expander Construction in {VNC1}}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {31:1--31:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.31}, doi = {10.4230/LIPICS.ITCS.2017.31}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BussKKK17.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/stoc/KabanetsKL17, author = {Valentine Kabanets and Daniel M. Kane and Zhenjian Lu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A polynomial restriction lemma with applications}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {615--628}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055470}, doi = {10.1145/3055399.3055470}, timestamp = {Sun, 02 Jun 2019 21:10:31 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KabanetsKL17.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/eccc/KabanetsKL17, author = {Valentine Kabanets and Daniel M. Kane and Zhenjian Lu}, title = {A Polynomial Restriction Lemma with Applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-026}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/026}, eprinttype = {ECCC}, eprint = {TR17-026}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsKL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChenKS16, author = {Ruiwen Chen and Valentine Kabanets and Nitin Saurabh}, title = {An Improved Deterministic {\#}SAT Algorithm for Small de Morgan Formulas}, journal = {Algorithmica}, volume = {76}, number = {1}, pages = {68--87}, year = {2016}, url = {https://doi.org/10.1007/s00453-015-0020-z}, doi = {10.1007/S00453-015-0020-Z}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChenKS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenK16, author = {Ruiwen Chen and Valentine Kabanets}, title = {Correlation bounds and {\#}SAT algorithms for small linear-size circuits}, journal = {Theor. Comput. Sci.}, volume = {654}, pages = {2--10}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.05.005}, doi = {10.1016/J.TCS.2016.05.005}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChenK16.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/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/dagstuhl-reports/KabanetsTTU16, author = {Valentine Kabanets and Thomas Thierauf and Jacobo Tor{\'{a}}n and Christopher Umans}, title = {Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411)}, journal = {Dagstuhl Reports}, volume = {6}, number = {10}, pages = {13--32}, year = {2016}, url = {https://doi.org/10.4230/DagRep.6.10.13}, doi = {10.4230/DAGREP.6.10.13}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/KabanetsTTU16.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/BussKKK16, author = {Sam Buss and Valentine Kabanets and Antonina Kolokolova and Michal Kouck{\'{y}}}, title = {Expander Construction in VNC\({}^{\mbox{1}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-144}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/144}, eprinttype = {ECCC}, eprint = {TR16-144}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BussKKK16.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/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} }
@article{DBLP:journals/cc/ChenKKSZ15, author = {Ruiwen Chen and Valentine Kabanets and Antonina Kolokolova and Ronen Shaltiel and David Zuckerman}, title = {Mining Circuit Lower Bound Proofs for Meta-Algorithms}, journal = {Comput. Complex.}, volume = {24}, number = {2}, pages = {333--392}, year = {2015}, url = {https://doi.org/10.1007/s00037-015-0100-0}, doi = {10.1007/S00037-015-0100-0}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/ChenKKSZ15.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} }
@inproceedings{DBLP:conf/cocoon/ChenK15, author = {Ruiwen Chen and Valentine Kabanets}, editor = {Dachuan Xu and Donglei Du and Ding{-}Zhu Du}, title = {Correlation Bounds and {\#}SAT Algorithms for Small Linear-Size Circuits}, booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON} 2015, Beijing, China, August 4-6, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9198}, pages = {211--222}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21398-9\_17}, doi = {10.1007/978-3-319-21398-9\_17}, timestamp = {Sun, 25 Oct 2020 22:58:52 +0100}, biburl = {https://dblp.org/rec/conf/cocoon/ChenK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AllenderHK15, author = {Eric Allender and Dhiraj Holden and Valentine Kabanets}, editor = {Ernst W. Mayr and Nicolas Ollinger}, title = {The Minimum Oracle Circuit Size Problem}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, {STACS} 2015, March 4-7, 2015, Garching, Germany}, series = {LIPIcs}, volume = {30}, pages = {21--33}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.STACS.2015.21}, doi = {10.4230/LIPICS.STACS.2015.21}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AllenderHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChenKK14, author = {Ruiwen Chen and Valentine Kabanets and Jeff Kinne}, title = {Lower Bounds Against Weakly-Uniform Threshold Circuits}, journal = {Algorithmica}, volume = {70}, number = {1}, pages = {47--75}, year = {2014}, url = {https://doi.org/10.1007/s00453-013-9823-y}, doi = {10.1007/S00453-013-9823-Y}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChenKK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChenKKSZ14, author = {Ruiwen Chen and Valentine Kabanets and Antonina Kolokolova and Ronen Shaltiel and David Zuckerman}, title = {Mining Circuit Lower Bound Proofs for Meta-algorithms}, booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver, BC, Canada, June 11-13, 2014}, pages = {262--273}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/CCC.2014.34}, doi = {10.1109/CCC.2014.34}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ChenKKSZ14.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} }
@inproceedings{DBLP:conf/mfcs/ChenKS14, author = {Ruiwen Chen and Valentine Kabanets and Nitin Saurabh}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {An Improved Deterministic {\#}SAT Algorithm for Small De Morgan Formulas}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8635}, pages = {165--176}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8\_15}, doi = {10.1007/978-3-662-44465-8\_15}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/ChenKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/AgrawalKTU14, author = {Manindra Agrawal and Valentine Kabanets and Thomas Thierauf and Christopher Umans}, title = {Algebra in Computational Complexity (Dagstuhl Seminar 14391)}, journal = {Dagstuhl Reports}, volume = {4}, number = {9}, pages = {85--105}, year = {2014}, url = {https://doi.org/10.4230/DagRep.4.9.85}, doi = {10.4230/DAGREP.4.9.85}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalKTU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderHK14, author = {Eric Allender and Dhiraj Holden and Valentine Kabanets}, title = {The Minimum Oracle Circuit Size Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-176}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/176}, eprinttype = {ECCC}, eprint = {TR14-176}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderHK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenK14, author = {Ruiwen Chen and Valentine Kabanets}, title = {Correlation Bounds and {\#}SAT Algorithms for Small Linear-Size Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-184}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/184}, eprinttype = {ECCC}, eprint = {TR14-184}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DellKMW13, author = {Holger Dell and Valentine Kabanets and Dieter van Melkebeek and Osamu Watanabe}, title = {Is Valiant-Vazirani's isolation probability improvable?}, journal = {Comput. Complex.}, volume = {22}, number = {2}, pages = {345--383}, year = {2013}, url = {https://doi.org/10.1007/s00037-013-0059-7}, doi = {10.1007/S00037-013-0059-7}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DellKMW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenKKSZ13, author = {Ruiwen Chen and Valentine Kabanets and Antonina Kolokolova and Ronen Shaltiel and David Zuckerman}, title = {Mining Circuit Lower Bound Proofs for Meta-Algorithms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-057}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/057}, eprinttype = {ECCC}, eprint = {TR13-057}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenKKSZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenKS13, author = {Ruiwen Chen and Valentine Kabanets and Nitin Saurabh}, title = {An Improved Deterministic {\#}SAT Algorithm for Small De Morgan Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-150}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/150}, eprinttype = {ECCC}, eprint = {TR13-150}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenKS13.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/eccc/KabanetsK13, author = {Valentine Kabanets and Antonina Kolokolova}, title = {Compression of Boolean Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-024}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/024}, eprinttype = {ECCC}, eprint = {TR13-024}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsK13.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/DellKMW12, author = {Holger Dell and Valentine Kabanets and Dieter van Melkebeek and Osamu Watanabe}, title = {Is Valiant-Vazirani's Isolation Probability Improvable?}, booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC} 2012, Porto, Portugal, June 26-29, 2012}, pages = {10--20}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/CCC.2012.22}, doi = {10.1109/CCC.2012.22}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/DellKMW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ChenK12, author = {Ruiwen Chen and Valentine Kabanets}, editor = {Joachim Gudmundsson and Juli{\'{a}}n Mestre and Taso Viglas}, title = {Lower Bounds against Weakly Uniform Circuits}, booktitle = {Computing and Combinatorics - 18th Annual International Conference, {COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7434}, pages = {408--419}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32241-9\_35}, doi = {10.1007/978-3-642-32241-9\_35}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ChenK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenK12, author = {Ruiwen Chen and Valentine Kabanets}, title = {Lower Bounds against Weakly Uniform Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-007}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/007}, eprinttype = {ECCC}, eprint = {TR12-007}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KabanetsW11, author = {Valentine Kabanets and Osamu Watanabe}, title = {Is the Valiant-Vazirani Isolation Lemma Improvable?}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-151}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/151}, eprinttype = {ECCC}, eprint = {TR11-151}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KabanetsW11.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} }
@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} }
@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/cc/JumaKRS09, author = {Ali Juma and Valentine Kabanets and Charles Rackoff and Amir Shpilka}, title = {The Black-Box Query Complexity of Polynomial Summation}, journal = {Comput. Complex.}, volume = {18}, number = {1}, pages = {59--79}, year = {2009}, url = {https://doi.org/10.1007/s00037-009-0263-7}, doi = {10.1007/S00037-009-0263-7}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/JumaKRS09.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/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/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/cc/GuruswamiK08, author = {Venkatesan Guruswami and Valentine Kabanets}, title = {Hardness Amplification via Space-Efficient Direct Products}, journal = {Comput. Complex.}, volume = {17}, number = {4}, pages = {475--500}, year = {2008}, url = {https://doi.org/10.1007/s00037-008-0253-1}, doi = {10.1007/S00037-008-0253-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GuruswamiK08.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/GuruswamiK07, author = {Venkatesan Guruswami and Valentine Kabanets}, title = {Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword}, journal = {Comput. Complex.}, volume = {16}, number = {2}, pages = {113--114}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0225-x}, doi = {10.1007/S00037-007-0225-X}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GuruswamiK07.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/eccc/JumaKRS07, author = {Ali Juma and Valentine Kabanets and Charles Rackoff and Amir Shpilka}, title = {The black-box query complexity of polynomial summation}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-125}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-125/index.html}, eprinttype = {ECCC}, eprint = {TR07-125}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JumaKRS07.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/latin/GuruswamiK06, author = {Venkatesan Guruswami and Valentine Kabanets}, editor = {Jos{\'{e}} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, title = {Hardness Amplification Via Space-Efficient Direct Products}, booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3887}, pages = {556--568}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11682462\_52}, doi = {10.1007/11682462\_52}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/GuruswamiK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Buresh-OppenheimKS06, author = {Joshua Buresh{-}Oppenheim and Valentine Kabanets and Rahul Santhanam}, title = {Uniform Hardness Amplification in {NP} via Monotone Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR06-154}}, year = {2006}, url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-154/index.html}, eprinttype = {ECCC}, eprint = {TR06-154}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Buresh-OppenheimKS06.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} }
@article{DBLP:journals/eccc/ECCC-TR05-057, author = {Venkatesan Guruswami and Valentine Kabanets}, title = {Hardness amplification via space-efficient direct products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-057}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-057/index.html}, eprinttype = {ECCC}, eprint = {TR05-057}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-057.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/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} }
@article{DBLP:journals/tcs/Kabanets03, author = {Valentine Kabanets}, title = {Almost k-wise independence and hard Boolean functions}, journal = {Theor. Comput. Sci.}, volume = {297}, number = {1-3}, pages = {281--295}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00643-6}, doi = {10.1016/S0304-3975(02)00643-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kabanets03.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/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} }
@article{DBLP:journals/eatcs/Kabanets02, author = {Valentine Kabanets}, title = {Derandomization: a brief overview}, journal = {Bull. {EATCS}}, volume = {76}, pages = {88--103}, year = {2002}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Kabanets02.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/eccc/ECCC-TR02-008, author = {Valentine Kabanets}, title = {Derandomization: {A} Brief Overview}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR02-008}}, year = {2002}, url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-008/index.html}, eprinttype = {ECCC}, eprint = {TR02-008}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-008.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} }
@phdthesis{DBLP:phd/ca/Kabanets01, author = {Valentine Kabanets}, title = {Nonuniformly hard boolean functions and uniform complexity classes}, school = {University of Toronto, Canada}, year = {2001}, url = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991106296003206196}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ca/Kabanets01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Kabanets01, author = {Valentine Kabanets}, title = {Easiness Assumptions and Hardness Tests: Trading Time for Zero Error}, journal = {J. Comput. Syst. Sci.}, volume = {63}, number = {2}, pages = {236--252}, year = {2001}, url = {https://doi.org/10.1006/jcss.2001.1763}, doi = {10.1006/JCSS.2001.1763}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Kabanets01.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/Kabanets00, author = {Valentine Kabanets}, title = {Easiness Assumptions and Hardness Tests: Trading Time for Zero Error}, booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational Complexity, Florence, Italy, July 4-7, 2000}, pages = {150--157}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/CCC.2000.856746}, doi = {10.1109/CCC.2000.856746}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Kabanets00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/Kabanets00, author = {Valentine Kabanets}, editor = {Gaston H. Gonnet and Daniel Panario and Alfredo Viola}, title = {Almost \emph{k}-Wise Independence and Hard Boolean Functions}, booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1776}, pages = {197--206}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/10719839\_20}, doi = {10.1007/10719839\_20}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/Kabanets00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KabanetsC00, author = {Valentine Kabanets and Jin{-}yi Cai}, editor = {F. Frances Yao and Eugene M. Luks}, title = {Circuit minimization problem}, booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, {USA}}, pages = {73--79}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/335305.335314}, doi = {10.1145/335305.335314}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KabanetsC00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR00-034, author = {Valentine Kabanets and Charles Rackoff and Stephen A. Cook}, title = {Efficiently Approximable Real-Valued Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR00-034}}, year = {2000}, url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-034/index.html}, eprinttype = {ECCC}, eprint = {TR00-034}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-034.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-004, author = {Valentine Kabanets}, title = {Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-004}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-004/index.html}, eprinttype = {ECCC}, eprint = {TR99-004}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-004.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-045, author = {Valentine Kabanets and Jin{-}yi Cai}, title = {Circuit Minimization Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-045}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-045/index.html}, eprinttype = {ECCC}, eprint = {TR99-045}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-045.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Kabanets97, author = {Valentine Kabanets}, editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti{-}Spaccamela}, title = {Recognizability Equals Definability for Partial k-Paths}, booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1256}, pages = {805--815}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63165-8\_233}, doi = {10.1007/3-540-63165-8\_233}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Kabanets97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.