Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andrej Bogdanov
@inproceedings{DBLP:conf/approx/BogdanovC0L23,
author = {Andrej Bogdanov and
Tsun Ming Cheung and
Krishnamoorthy Dinesh and
John C. S. Lui},
editor = {Nicole Megow and
Adam D. Smith},
title = {Classical Simulation of One-Query Quantum Distinguishers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.43},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.43},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BogdanovC0L23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/citc/Bogdanov23,
author = {Andrej Bogdanov},
editor = {Kai{-}Min Chung},
title = {Csirmaz's Duality Conjecture and Threshold Secret Sharing},
booktitle = {4th Conference on Information-Theoretic Cryptography, {ITC} 2023,
June 6-8, 2023, Aarhus University, Aarhus, Denmark},
series = {LIPIcs},
volume = {267},
pages = {3:1--3:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITC.2023.3},
doi = {10.4230/LIPICS.ITC.2023.3},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/citc/Bogdanov23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Bogdanov0FIKS23,
author = {Andrej Bogdanov and
Krishnamoorthy Dinesh and
Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Sruthi Sekar},
editor = {Patricia Bouyer and
Srikanth Srinivasan},
title = {Bounded Simultaneous Messages},
booktitle = {43rd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2023, December 18-20, 2023,
{IIIT} Hyderabad, Telangana, India},
series = {LIPIcs},
volume = {284},
pages = {23:1--23:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2023.23},
doi = {10.4230/LIPICS.FSTTCS.2023.23},
timestamp = {Wed, 13 Dec 2023 14:08:06 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Bogdanov0FIKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BogdanovR23,
author = {Andrej Bogdanov and
Alon Rosen},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Nondeterministic Interactive Refutations for Nearest Boolean Vector},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {28:1--28:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.28},
doi = {10.4230/LIPICS.ICALP.2023.28},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BogdanovR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovKR23,
author = {Andrej Bogdanov and
Pravesh K. Kothari and
Alon Rosen},
editor = {Guy N. Rothblum and
Hoeteck Wee},
title = {Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree
Method},
booktitle = {Theory of Cryptography - 21st International Conference, {TCC} 2023,
Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {14369},
pages = {268--285},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-48615-9\_10},
doi = {10.1007/978-3-031-48615-9\_10},
timestamp = {Wed, 06 Dec 2023 13:56:14 +0100},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-00334,
author = {Andrej Bogdanov and
Krishnamoorthy Dinesh and
Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Sruthi Sekar},
title = {Bounded Simultaneous Messages},
journal = {CoRR},
volume = {abs/2310.00334},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.00334},
doi = {10.48550/ARXIV.2310.00334},
eprinttype = {arXiv},
eprint = {2310.00334},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-00334.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovC0L23,
author = {Andrej Bogdanov and
TsunMing Cheung and
Krishnamoorthy Dinesh and
John C. S. Lui},
title = {Classical simulation of one-query quantum distinguishers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-108}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/108},
eprinttype = {ECCC},
eprint = {TR23-108},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovC0L23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovKR23,
author = {Andrej Bogdanov and
Pravesh Kothari and
Alon Rosen},
title = {Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree
Method},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-098}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/098},
eprinttype = {ECCC},
eprint = {TR23-098},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovKR23,
author = {Andrej Bogdanov and
Pravesh Kothari and
Alon Rosen},
title = {Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree
Method},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1049},
year = {2023},
url = {https://eprint.iacr.org/2023/1049},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BogdanovIS22,
author = {Andrej Bogdanov and
Yuval Ishai and
Akshayaram Srinivasan},
title = {Correction to: Unconditionally Secure Computation Against Low-Complexity
Leakage},
journal = {J. Cryptol.},
volume = {35},
number = {1},
pages = {2},
year = {2022},
url = {https://doi.org/10.1007/s00145-021-09412-0},
doi = {10.1007/S00145-021-09412-0},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/BogdanovIS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BogdanovIS22a,
author = {Andrej Bogdanov and
Yuval Ishai and
Akshayaram Srinivasan},
title = {Correction to: Unconditionally Secure Computation Against Low-Complexity
Leakage},
journal = {J. Cryptol.},
volume = {35},
number = {2},
pages = {7},
year = {2022},
url = {https://doi.org/10.1007/s00145-021-09417-9},
doi = {10.1007/S00145-021-09417-9},
timestamp = {Mon, 21 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/BogdanovIS22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovHPP22,
author = {Andrej Bogdanov and
William M. Hoza and
Gautam Prakriya and
Edward Pyne},
editor = {Shachar Lovett},
title = {Hitting Sets for Regular Branching Programs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {3:1--3:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.3},
doi = {10.4230/LIPICS.CCC.2022.3},
timestamp = {Tue, 12 Jul 2022 17:25:23 +0200},
biburl = {https://dblp.org/rec/conf/coco/BogdanovHPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Bogdanov0FIKS22,
author = {Andrej Bogdanov and
Krishnamoorthy Dinesh and
Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Akshayaram Srinivasan},
editor = {Mark Braverman},
title = {Bounded Indistinguishability for Simple Sources},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.26},
doi = {10.4230/LIPICS.ITCS.2022.26},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Bogdanov0FIKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovNHR22,
author = {Andrej Bogdanov and
Miguel Cueto Noval and
Charlotte Hoffmann and
Alon Rosen},
editor = {Eike Kiltz and
Vinod Vaikuntanathan},
title = {Public-Key Encryption from Homogeneous {CLWE}},
booktitle = {Theory of Cryptography - 20th International Conference, {TCC} 2022,
Chicago, IL, USA, November 7-10, 2022, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13748},
pages = {565--592},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22365-5\_20},
doi = {10.1007/978-3-031-22365-5\_20},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovNHR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovNHR22,
author = {Andrej Bogdanov and
Miguel Cueto Noval and
Charlotte Hoffmann and
Alon Rosen},
title = {Public-Key Encryption from Continuous {LWE}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-011}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/011},
eprinttype = {ECCC},
eprint = {TR22-011},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovNHR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovNHR22,
author = {Andrej Bogdanov and
Miguel Cueto Noval and
Charlotte Hoffmann and
Alon Rosen},
title = {Public-Key Encryption from Continuous {LWE}},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {93},
year = {2022},
url = {https://eprint.iacr.org/2022/093},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovNHR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BogdanovIS21,
author = {Andrej Bogdanov and
Yuval Ishai and
Akshayaram Srinivasan},
title = {Unconditionally Secure Computation Against Low-Complexity Leakage},
journal = {J. Cryptol.},
volume = {34},
number = {4},
pages = {38},
year = {2021},
url = {https://doi.org/10.1007/s00145-021-09402-2},
doi = {10.1007/S00145-021-09402-2},
timestamp = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BogdanovIS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BogdanovP21,
author = {Andrej Bogdanov and
Gautam Prakriya},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Direct Sum and Partitionability Testing over General Groups},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {33:1--33:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.33},
doi = {10.4230/LIPICS.ICALP.2021.33},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BogdanovP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictinnovations/Bogdanov21,
author = {Andrej Bogdanov},
editor = {Ljupcho Antovski and
Goce Armenski},
title = {A Gentle Introduction to Zero-Knowledge},
booktitle = {{ICT} Innovations 2021. Digital Transformation - 13th International
Conference, {ICT} Innovations 2021, Virtual Event, September 27-28,
2021, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {1521},
pages = {3--10},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-031-04206-5\_1},
doi = {10.1007/978-3-031-04206-5\_1},
timestamp = {Wed, 13 Apr 2022 15:34:23 +0200},
biburl = {https://dblp.org/rec/conf/ictinnovations/Bogdanov21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/AbeABOR21,
author = {Masayuki Abe and
Miguel Ambrona and
Andrej Bogdanov and
Miyako Ohkubo and
Alon Rosen},
editor = {Kobbi Nissim and
Brent Waters},
title = {Acyclicity Programming for Sigma-Protocols},
booktitle = {Theory of Cryptography - 19th International Conference, {TCC} 2021,
Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {13042},
pages = {435--465},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-90459-3\_15},
doi = {10.1007/978-3-030-90459-3\_15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/AbeABOR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonABDM21,
author = {Scott Aaronson and
Andris Ambainis and
Andrej Bogdanov and
Krishnamoorthy Dinesh and
Tsun Ming Cheung},
title = {On quantum versus classical query complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-115}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/115},
eprinttype = {ECCC},
eprint = {TR21-115},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonABDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovDFIKS21,
author = {Andrej Bogdanov and
Krishnamoorthy Dinesh and
Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Akshayaram Srinivasan},
title = {Bounded Indistinguishability for Simple Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-093}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/093},
eprinttype = {ECCC},
eprint = {TR21-093},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovDFIKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AbeABOR21,
author = {Masayuki Abe and
Miguel Ambrona and
Andrej Bogdanov and
Miyako Ohkubo and
Alon Rosen},
title = {Acyclicity Programming for Sigma-Protocols},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {135},
year = {2021},
url = {https://eprint.iacr.org/2021/135},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/AbeABOR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AbeABOR21a,
author = {Masayuki Abe and
Miguel Ambrona and
Andrej Bogdanov and
Miyako Ohkubo and
Alon Rosen},
title = {Non-Interactive Composition of Sigma-Protocols via Share-then-Hash},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {457},
year = {2021},
url = {https://eprint.iacr.org/2021/457},
timestamp = {Thu, 22 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AbeABOR21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BogdanovGK20,
author = {Andrej Bogdanov and
Siyao Guo and
Ilan Komargodski},
title = {Threshold Secret Sharing Requires a Linear-Size Alphabet},
journal = {Theory Comput.},
volume = {16},
pages = {1--18},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a002},
doi = {10.4086/TOC.2020.V016A002},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/BogdanovGK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/AbeABOR20,
author = {Masayuki Abe and
Miguel Ambrona and
Andrej Bogdanov and
Miyako Ohkubo and
Alon Rosen},
editor = {Shiho Moriai and
Huaxiong Wang},
title = {Non-interactive Composition of Sigma-Protocols via Share-then-Hash},
booktitle = {Advances in Cryptology - {ASIACRYPT} 2020 - 26th International Conference
on the Theory and Application of Cryptology and Information Security,
Daejeon, South Korea, December 7-11, 2020, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12493},
pages = {749--773},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64840-4\_25},
doi = {10.1007/978-3-030-64840-4\_25},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/asiacrypt/AbeABOR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BogdanovW20,
author = {Andrej Bogdanov and
Baoxiang Wang},
editor = {Thomas Vidick},
title = {Learning and Testing Variable Partitions},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {37:1--37:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.37},
doi = {10.4230/LIPICS.ITCS.2020.37},
timestamp = {Fri, 17 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BogdanovW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-12990,
author = {Andrej Bogdanov and
Baoxiang Wang},
title = {Learning and Testing Variable Partitions},
journal = {CoRR},
volume = {abs/2003.12990},
year = {2020},
url = {https://arxiv.org/abs/2003.12990},
eprinttype = {arXiv},
eprint = {2003.12990},
timestamp = {Fri, 17 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-12990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovP20,
author = {Andrej Bogdanov and
Gautam Prakriya},
title = {Direct Sum and Partitionability Testing over General Groups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-164}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/164},
eprinttype = {ECCC},
eprint = {TR20-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovMTW19,
author = {Andrej Bogdanov and
Nikhil S. Mande and
Justin Thaler and
Christopher Williamson},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Approximate Degree, Secret Sharing, and Concentration Phenomena},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {71:1--71:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.71},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.71},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovMTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BogdanovIS19,
author = {Andrej Bogdanov and
Yuval Ishai and
Akshayaram Srinivasan},
editor = {Alexandra Boldyreva and
Daniele Micciancio},
title = {Unconditionally Secure Computation Against Low-Complexity Leakage},
booktitle = {Advances in Cryptology - {CRYPTO} 2019 - 39th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019,
Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {11693},
pages = {387--416},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26951-7\_14},
doi = {10.1007/978-3-030-26951-7\_14},
timestamp = {Fri, 09 Aug 2019 14:22:41 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BogdanovIS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/WangBBJ19,
author = {Xishi Nicholas Wang and
Amitalok J. Budkuley and
Andrej Bogdanov and
Sidharth Jaggi},
title = {When are large codes possible for AVCs?},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {632--636},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849324},
doi = {10.1109/ISIT.2019.8849324},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/WangBBJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BogdanovSV19,
author = {Andrej Bogdanov and
Manuel Sabin and
Prashant Nalini Vasudevan},
editor = {Timothy M. Chan},
title = {{XOR} Codes and Sparse Learning Parity with Noise},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {986--1004},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.61},
doi = {10.1137/1.9781611975482.61},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/BogdanovSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00326,
author = {Andrej Bogdanov and
Nikhil S. Mande and
Justin Thaler and
Christopher Williamson},
title = {Approximate degree, secret sharing, and concentration phenomena},
journal = {CoRR},
volume = {abs/1906.00326},
year = {2019},
url = {http://arxiv.org/abs/1906.00326},
eprinttype = {arXiv},
eprint = {1906.00326},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovMTW19,
author = {Andrej Bogdanov and
Nikhil S. Mande and
Justin Thaler and
Christopher Williamson},
title = {Approximate degree, secret sharing, and concentration phenomena},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-082}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/082},
eprinttype = {ECCC},
eprint = {TR19-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovMTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovIS19,
author = {Andrej Bogdanov and
Yuval Ishai and
Akshayaram Srinivasan},
title = {Unconditionally Secure Computation Against Low-Complexity Leakage},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {627},
year = {2019},
url = {https://eprint.iacr.org/2019/627},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovIS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BeigiBEG18,
author = {Salman Beigi and
Andrej Bogdanov and
Omid Etesami and
Siyao Guo},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.30},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.30},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BeigiBEG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bogdanov18,
author = {Andrej Bogdanov},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Small Bias Requires Large Formulas},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {22:1--22:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.22},
doi = {10.4230/LIPICS.ICALP.2018.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Bogdanov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bogdanov18,
author = {Andrej Bogdanov},
title = {Approximate degree of {AND} via Fourier analysis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-197}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/197},
eprinttype = {ECCC},
eprint = {TR18-197},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bogdanov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovSV18,
author = {Andrej Bogdanov and
Manuel Sabin and
Prashant Nalini Vasudevan},
title = {{XOR} Codes and Sparse Random Linear Equations with Noise},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-085}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/085},
eprinttype = {ECCC},
eprint = {TR18-085},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BogdanovW17,
author = {Andrej Bogdanov and
Christopher Williamson},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Approximate Bounded Indistinguishability},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {53:1--53:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.53},
doi = {10.4230/LIPICS.ICALP.2017.53},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BogdanovW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/17/BogdanovR17,
author = {Andrej Bogdanov and
Alon Rosen},
editor = {Yehuda Lindell},
title = {Pseudorandom Functions: Three Decades Later},
booktitle = {Tutorials on the Foundations of Cryptography},
pages = {79--158},
publisher = {Springer International Publishing},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57048-8\_3},
doi = {10.1007/978-3-319-57048-8\_3},
timestamp = {Thu, 29 Jun 2017 17:40:41 +0200},
biburl = {https://dblp.org/rec/books/sp/17/BogdanovR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-03053,
author = {Salman Beigi and
Andrej Bogdanov and
Omid Etesami and
Siyao Guo},
title = {Complete Classification of Generalized Santha-Vazirani Sources},
journal = {CoRR},
volume = {abs/1709.03053},
year = {2017},
url = {http://arxiv.org/abs/1709.03053},
eprinttype = {arXiv},
eprint = {1709.03053},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-03053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeigiBEG17,
author = {Salman Beigi and
Andrej Bogdanov and
Omid Etesami and
Siyao Guo},
title = {Complete Classi fication of Generalized Santha-Vazirani Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-136}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/136},
eprinttype = {ECCC},
eprint = {TR17-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeigiBEG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bogdanov17,
author = {Andrej Bogdanov},
title = {Small bias requires large formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-091}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/091},
eprinttype = {ECCC},
eprint = {TR17-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bogdanov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovR17,
author = {Andrej Bogdanov and
Alon Rosen},
title = {Pseudorandom Functions: Three Decades Later},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-113}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/113},
eprinttype = {ECCC},
eprint = {TR17-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovR17,
author = {Andrej Bogdanov and
Alon Rosen},
title = {Pseudorandom Functions: Three Decades Later},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {652},
year = {2017},
url = {http://eprint.iacr.org/2017/652},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/ApplebaumBR16,
author = {Benny Applebaum and
Andrej Bogdanov and
Alon Rosen},
title = {A Dichotomy for Local Small-Bias Generators},
journal = {J. Cryptol.},
volume = {29},
number = {3},
pages = {577--596},
year = {2016},
url = {https://doi.org/10.1007/s00145-015-9202-8},
doi = {10.1007/S00145-015-9202-8},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/ApplebaumBR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BogdanovIVW16,
author = {Andrej Bogdanov and
Yuval Ishai and
Emanuele Viola and
Christopher Williamson},
editor = {Matthew Robshaw and
Jonathan Katz},
title = {Bounded Indistinguishability and the Complexity of Recovering Secrets},
booktitle = {Advances in Cryptology - {CRYPTO} 2016 - 36th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016,
Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {9816},
pages = {593--618},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53015-3\_21},
doi = {10.1007/978-3-662-53015-3\_21},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BogdanovIVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovGMRR16,
author = {Andrej Bogdanov and
Siyao Guo and
Daniel Masny and
Silas Richelson and
Alon Rosen},
editor = {Eyal Kushilevitz and
Tal Malkin},
title = {On the Hardness of Learning with Rounding over Small Modulus},
booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9562},
pages = {209--224},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49096-9\_9},
doi = {10.1007/978-3-662-49096-9\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovGMRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovL16,
author = {Andrej Bogdanov and
Chin Ho Lee},
editor = {Eyal Kushilevitz and
Tal Malkin},
title = {Homomorphic Evaluation Requires Depth},
booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9562},
pages = {365--371},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49096-9\_15},
doi = {10.1007/978-3-662-49096-9\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovGK16,
author = {Andrej Bogdanov and
Siyao Guo and
Ilan Komargodski},
editor = {Martin Hirt and
Adam D. Smith},
title = {Threshold Secret Sharing Requires a Linear Size Alphabet},
booktitle = {Theory of Cryptography - 14th International Conference, {TCC} 2016-B,
Beijing, China, October 31 - November 3, 2016, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9986},
pages = {471--484},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53644-5\_18},
doi = {10.1007/978-3-662-53644-5\_18},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovGK16,
author = {Andrej Bogdanov and
Siyao Guo and
Ilan Komargodski},
title = {Threshold Secret Sharing Requires a Linear Size Alphabet},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-131}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/131},
eprinttype = {ECCC},
eprint = {TR16-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovIVW16,
author = {Andrej Bogdanov and
Yuval Ishai and
Emanuele Viola and
Christopher Williamson},
title = {Bounded Indistinguishability and the Complexity of Recovering Secrets},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {565},
year = {2016},
url = {http://eprint.iacr.org/2016/565},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovIVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovB15,
author = {Andrej Bogdanov and
Christina Brzuska},
editor = {Yevgeniy Dodis and
Jesper Buus Nielsen},
title = {On Basing Size-Verifiable One-Way Functions on NP-Hardness},
booktitle = {Theory of Cryptography - 12th Theory of Cryptography Conference, {TCC}
2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9014},
pages = {1--6},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46494-6\_1},
doi = {10.1007/978-3-662-46494-6\_1},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovIVW15,
author = {Andrej Bogdanov and
Yuval Ishai and
Emanuele Viola and
Christopher Williamson},
title = {Bounded Indistinguishability and the Complexity of Recovering Secrets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-182}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/182},
eprinttype = {ECCC},
eprint = {TR15-182},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovIVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovGMRR15,
author = {Andrej Bogdanov and
Siyao Guo and
Daniel Masny and
Silas Richelson and
Alon Rosen},
title = {On the Hardness of Learning with Rounding over Small Modulus},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {769},
year = {2015},
url = {http://eprint.iacr.org/2015/769},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovGMRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovL15,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {Homomorphic evaluation requires depth},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1044},
year = {2015},
url = {http://eprint.iacr.org/2015/1044},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AkaviaBGKR14,
author = {Adi Akavia and
Andrej Bogdanov and
Siyao Guo and
Akshay Kamath and
Alon Rosen},
editor = {Moni Naor},
title = {Candidate weak pseudorandom functions in AC\({}^{\mbox{0}}\) {\unicode{9675}}
MOD\({}_{\mbox{2}}\)},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {251--260},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554821},
doi = {10.1145/2554797.2554821},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AkaviaBGKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AkaviaBGKR14,
author = {Adi Akavia and
Andrej Bogdanov and
Siyao Guo and
Akshay Kamath and
Alon Rosen},
title = {Candidate weak pseudorandom functions in AC\({}^{\mbox{0}}\) {\unicode{9675}}
MOD\({}_{\mbox{2}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-033}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/033},
eprinttype = {ECCC},
eprint = {TR14-033},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AkaviaBGKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovB14,
author = {Andrej Bogdanov and
Christina Brzuska},
title = {On Basing Size-Verifiable One-Way Functions on NP-Hardness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-108}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/108},
eprinttype = {ECCC},
eprint = {TR14-108},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BogdanovR13,
author = {Andrej Bogdanov and
Alon Rosen},
title = {Input Locality and Hardness Amplification},
journal = {J. Cryptol.},
volume = {26},
number = {1},
pages = {144--171},
year = {2013},
url = {https://doi.org/10.1007/s00145-011-9117-y},
doi = {10.1007/S00145-011-9117-Y},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BogdanovR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BogdanovDVY13,
author = {Andrej Bogdanov and
Zeev Dvir and
Elad Verbin and
Amir Yehudayoff},
title = {Pseudorandomness for Width-2 Branching Programs},
journal = {Theory Comput.},
volume = {9},
pages = {283--293},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a007},
doi = {10.4086/TOC.2013.V009A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BogdanovDVY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BogdanovKT13,
author = {Andrej Bogdanov and
Akinori Kawachi and
Hidetoki Tanaka},
title = {Hard Functions for Low-Degree Polynomials over Prime Fields},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {2},
pages = {5:1--5:15},
year = {2013},
url = {https://doi.org/10.1145/2493246.2493248},
doi = {10.1145/2493246.2493248},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BogdanovKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BogdanovL13,
author = {Andrej Bogdanov and
Chin Ho Lee},
editor = {Ran Canetti and
Juan A. Garay},
title = {Limits of Provable Security for Homomorphic Encryption},
booktitle = {Advances in Cryptology - {CRYPTO} 2013 - 33rd Annual Cryptology Conference,
Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8042},
pages = {111--128},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40041-4\_7},
doi = {10.1007/978-3-642-40041-4\_7},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BogdanovL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BogdanovG13,
author = {Andrej Bogdanov and
Siyao Guo},
editor = {Robert D. Kleinberg},
title = {Sparse extractor families for all the entropy},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {553--560},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422496},
doi = {10.1145/2422436.2422496},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BogdanovG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovL13,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {Limits of provable security for homomorphic encryption},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {344},
year = {2013},
url = {http://eprint.iacr.org/2013/344},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BogdanovQ12,
author = {Andrej Bogdanov and
Youming Qiao},
title = {On the security of Goldreich's one-way function},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {83--127},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0034-0},
doi = {10.1007/S00037-011-0034-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BogdanovQ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovPW12,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Pseudorandomness for Linear Length Branching Programs and Stack Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {447--458},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_38},
doi = {10.1007/978-3-642-32512-0\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/ApplebaumBR12,
author = {Benny Applebaum and
Andrej Bogdanov and
Alon Rosen},
editor = {Ronald Cramer},
title = {A Dichotomy for Local Small-Bias Generators},
booktitle = {Theory of Cryptography - 9th Theory of Cryptography Conference, {TCC}
2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7194},
pages = {600--617},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28914-9\_34},
doi = {10.1007/978-3-642-28914-9\_34},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/ApplebaumBR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-6260,
author = {Andrej Bogdanov and
Siyao Guo},
title = {Sparse extractor families for all the entropy},
journal = {CoRR},
volume = {abs/1207.6260},
year = {2012},
url = {http://arxiv.org/abs/1207.6260},
eprinttype = {arXiv},
eprint = {1207.6260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-6260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovG12,
author = {Andrej Bogdanov and
Siyao Guo},
title = {Sparse extractor families for all the entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-097}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/097},
eprinttype = {ECCC},
eprint = {TR12-097},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovL12,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {Limits of provable security for homomorphic encryption},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-156}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/156},
eprinttype = {ECCC},
eprint = {TR12-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovL12a,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {On the depth complexity of homomorphic encryption schemes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-157}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/157},
eprinttype = {ECCC},
eprint = {TR12-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovL12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BogdanovM11,
author = {Andrej Bogdanov and
Elchanan Mossel},
title = {On Extracting Common Random Bits From Correlated Sources},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {10},
pages = {6351--6355},
year = {2011},
url = {https://doi.org/10.1109/TIT.2011.2134067},
doi = {10.1109/TIT.2011.2134067},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BogdanovM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhatnagarBM11,
author = {Nayantara Bhatnagar and
Andrej Bogdanov and
Elchanan Mossel},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {The Computational Complexity of Estimating {MCMC} Convergence Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {424--435},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_36},
doi = {10.1007/978-3-642-22935-0\_36},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhatnagarBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovPW11,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
editor = {Rafail Ostrovsky},
title = {Pseudorandomness for Read-Once Formulas},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {240--246},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.57},
doi = {10.1109/FOCS.2011.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BogdanovKT11,
author = {Andrej Bogdanov and
Akinori Kawachi and
Hidetoki Tanaka},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Hard Functions for Low-Degree Polynomials over Prime Fields},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {120--131},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_14},
doi = {10.1007/978-3-642-22993-0\_14},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BogdanovKT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovR11,
author = {Andrej Bogdanov and
Alon Rosen},
editor = {Yuval Ishai},
title = {Input Locality and Hardness Amplification},
booktitle = {Theory of Cryptography - 8th Theory of Cryptography Conference, {TCC}
2011, Providence, RI, USA, March 28-30, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6597},
pages = {1--18},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19571-6\_1},
doi = {10.1007/978-3-642-19571-6\_1},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-4301,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {Homomorphic encryption from codes},
journal = {CoRR},
volume = {abs/1111.4301},
year = {2011},
url = {http://arxiv.org/abs/1111.4301},
eprinttype = {arXiv},
eprint = {1111.4301},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-4301.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumBR11,
author = {Benny Applebaum and
Andrej Bogdanov and
Alon Rosen},
title = {A Dichotomy for Local Small-Bias Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-126}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/126},
eprinttype = {ECCC},
eprint = {TR11-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumBR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovPW11,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
title = {Pseudorandomness for read-once formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-117}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/117},
eprinttype = {ECCC},
eprint = {TR11-117},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovR11,
author = {Andrej Bogdanov and
Alon Rosen},
title = {Input locality and hardness amplification},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-012}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/012},
eprinttype = {ECCC},
eprint = {TR11-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ApplebaumBR11,
author = {Benny Applebaum and
Andrej Bogdanov and
Alon Rosen},
title = {A Dichotomy for Local Small-Bias Generators},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {512},
year = {2011},
url = {http://eprint.iacr.org/2011/512},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ApplebaumBR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovL11,
author = {Andrej Bogdanov and
Chin Ho Lee},
title = {Homomorphic encryption from codes},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {622},
year = {2011},
url = {http://eprint.iacr.org/2011/622},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BogdanovV10,
author = {Andrej Bogdanov and
Emanuele Viola},
title = {Pseudorandom Bits for Polynomials},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2464--2486},
year = {2010},
url = {https://doi.org/10.1137/070712109},
doi = {10.1137/070712109},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BogdanovV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BogdanovTW10,
author = {Andrej Bogdanov and
Kunal Talwar and
Andrew Wan},
editor = {Andrew Chi{-}Chih Yao},
title = {Hard Instances for Satisfiability and Quasi-one-way Functions},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {290--300},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/23.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BogdanovTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0089,
author = {Nayantara Bhatnagar and
Andrej Bogdanov and
Elchanan Mossel},
title = {The Computational Complexity of Estimating Convergence Time},
journal = {CoRR},
volume = {abs/1007.0089},
year = {2010},
url = {http://arxiv.org/abs/1007.0089},
eprinttype = {arXiv},
eprint = {1007.0089},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0089.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2315,
author = {Andrej Bogdanov and
Elchanan Mossel},
title = {On extracting common random bits from correlated sources},
journal = {CoRR},
volume = {abs/1007.2315},
year = {2010},
url = {http://arxiv.org/abs/1007.2315},
eprinttype = {arXiv},
eprint = {1007.2315},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2315.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-0531,
author = {Andrej Bogdanov and
Fan Li},
title = {A better tester for bipartiteness?},
journal = {CoRR},
volume = {abs/1011.0531},
year = {2010},
url = {http://arxiv.org/abs/1011.0531},
eprinttype = {arXiv},
eprint = {1011.0531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-0531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovQ09,
author = {Andrej Bogdanov and
Youming Qiao},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {On the Security of Goldreich's One-Way Function},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {392--405},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_30},
doi = {10.1007/978-3-642-03685-9\_30},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovQ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovDVY09,
author = {Andrej Bogdanov and
Zeev Dvir and
Elad Verbin and
Amir Yehudayoff},
title = {Pseudorandomness for Width 2 Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-070}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/070},
eprinttype = {ECCC},
eprint = {TR09-070},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovDVY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovMV08,
author = {Andrej Bogdanov and
Elchanan Mossel and
Salil P. Vadhan},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {The Complexity of Distinguishing Markov Random Fields},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {331--342},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_27},
doi = {10.1007/978-3-540-85363-3\_27},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovV07,
author = {Andrej Bogdanov and
Emanuele Viola},
title = {Pseudorandom Bits for Polynomials},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {41--51},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.56},
doi = {10.1109/FOCS.2007.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovS07,
author = {Andrej Bogdanov and
Muli Safra},
title = {Hardness Amplification for Errorless Heuristics},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {418--426},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.25},
doi = {10.1109/FOCS.2007.25},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BogdanovS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovS07,
author = {Andrej Bogdanov and
Muli Safra},
title = {Hardness amplification for errorless heuristics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-102}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-102/index.html},
eprinttype = {ECCC},
eprint = {TR07-102},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovV07,
author = {Andrej Bogdanov and
Emanuele Viola},
title = {Pseudorandom bits for polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-081}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-081/index.html},
eprinttype = {ECCC},
eprint = {TR07-081},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {2},
number = {1},
year = {2006},
url = {https://doi.org/10.1561/0400000004},
doi = {10.1561/0400000004},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {4},
pages = {1119--1159},
year = {2006},
url = {https://doi.org/10.1137/S0097539705446974},
doi = {10.1137/S0097539705446974},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0606037,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {CoRR},
volume = {abs/cs/0606037},
year = {2006},
url = {http://arxiv.org/abs/cs/0606037},
eprinttype = {arXiv},
eprint = {cs/0606037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-073}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-073/index.html},
eprinttype = {ECCC},
eprint = {TR06-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovW05,
author = {Andrej Bogdanov and
Hoeteck Wee},
title = {More on Noncommutative Polynomial Identity Testing},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {92--99},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.13},
doi = {10.1109/CCC.2005.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BogdanovW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bogdanov05,
author = {Andrej Bogdanov},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Pseudorandom generators for low degree polynomials},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {21--30},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060594},
doi = {10.1145/1060590.1060594},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bogdanov05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-015,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-015}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-015/index.html},
eprinttype = {ECCC},
eprint = {TR05-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovW04,
author = {Andrej Bogdanov and
Hoeteck Wee},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {A Stateful Implementation of a Random Function Supporting Parity Queries
over Hypercubes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {298--309},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_27},
doi = {10.1007/978-3-540-27821-4\_27},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovT04,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {75--81},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313803},
doi = {10.1109/CCC.2004.1313803},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BogdanovT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BogdanovMR04,
author = {Andrej Bogdanov and
Elitza N. Maneva and
Samantha J. Riesenfeld},
title = {Power-aware base station positioning for sensor networks},
booktitle = {Proceedings {IEEE} {INFOCOM} 2004, The 23rd Annual Joint Conference
of the {IEEE} Computer and Communications Societies, Hong Kong, China,
March 7-11, 2004},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/INFCOM.2004.1354529},
doi = {10.1109/INFCOM.2004.1354529},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/BogdanovMR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovT03,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {308--317},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238205},
doi = {10.1109/SFCS.2003.1238205},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovOT02,
author = {Andrej Bogdanov and
Kenji Obata and
Luca Trevisan},
title = {A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {93--102},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181886},
doi = {10.1109/SFCS.2002.1181886},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovOT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forte/BogdanovGL02,
author = {Andrej Bogdanov and
Stephen J. Garland and
Nancy A. Lynch},
editor = {Doron A. Peled and
Moshe Y. Vardi},
title = {Mechanical Translation of {I/O} Automaton Specifications into First-Order
Logic},
booktitle = {Formal Techniques for Networked and Distributed Systems - {FORTE}
2002, 22nd {IFIP} {WG} 6.1 International Conference Houston, Texas,
USA, November 11-14, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2529},
pages = {364--368},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36135-9\_24},
doi = {10.1007/3-540-36135-9\_24},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/forte/BogdanovGL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-064,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-064}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-064/index.html},
eprinttype = {ECCC},
eprint = {TR02-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-064.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-02-06 23:50 CET 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:
