default search action
BibTeX records: Mark Bun
@article{DBLP:journals/pacmmod/BunGN024, author = {Mark Bun and Marco Gaboardi and Marcel Neunhoeffer and Wanrong Zhang}, title = {Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections}, journal = {Proc. {ACM} Manag. Data}, volume = {2}, number = {2}, pages = {94}, year = {2024}, url = {https://doi.org/10.1145/3651595}, doi = {10.1145/3651595}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmmod/BunGN024.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alt/BunCD24, author = {Mark Bun and Aloni Cohen and Rathin Desai}, editor = {Claire Vernade and Daniel Hsu}, title = {Private {PAC} Learning May be Harder than Online Learning}, booktitle = {International Conference on Algorithmic Learning Theory, 25-28 February 2024, La Jolla, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {237}, pages = {362--389}, publisher = {{PMLR}}, year = {2024}, url = {https://proceedings.mlr.press/v237/bun24a.html}, timestamp = {Mon, 13 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alt/BunCD24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alt/Bun0MS24, author = {Mark Bun and Gautam Kamath and Argyris Mouzakis and Vikrant Singhal}, editor = {Claire Vernade and Daniel Hsu}, title = {Not All Learnable Distribution Classes are Privately Learnable}, booktitle = {International Conference on Algorithmic Learning Theory, 25-28 February 2024, La Jolla, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {237}, pages = {390--401}, publisher = {{PMLR}}, year = {2024}, url = {https://proceedings.mlr.press/v237/bun24b.html}, timestamp = {Mon, 13 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alt/Bun0MS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-00267, author = {Mark Bun and Gautam Kamath and Argyris Mouzakis and Vikrant Singhal}, title = {Not All Learnable Distribution Classes are Privately Learnable}, journal = {CoRR}, volume = {abs/2402.00267}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.00267}, doi = {10.48550/ARXIV.2402.00267}, eprinttype = {arXiv}, eprint = {2402.00267}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-00267.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-09483, author = {Adam Block and Mark Bun and Rathin Desai and Abhishek Shetty and Steven Wu}, title = {Oracle-Efficient Differentially Private Learning with Public Data}, journal = {CoRR}, volume = {abs/2402.09483}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.09483}, doi = {10.48550/ARXIV.2402.09483}, eprinttype = {arXiv}, eprint = {2402.09483}, timestamp = {Fri, 16 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-09483.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-11119, author = {Mark Bun and Aloni Cohen and Rathin Desai}, title = {Private {PAC} Learning May be Harder than Online Learning}, journal = {CoRR}, volume = {abs/2402.11119}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.11119}, doi = {10.48550/ARXIV.2402.11119}, eprinttype = {arXiv}, eprint = {2402.11119}, timestamp = {Mon, 26 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-11119.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/AliakbarpourBS23, author = {Maryam Aliakbarpour and Mark Bun and Adam Smith}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Hypothesis Selection with Memory Constraints}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/9dd67d30e0edd53581363c1b49006e1d-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/AliakbarpourBS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunGHILPSS23, author = {Mark Bun and Marco Gaboardi and Max Hopkins and Russell Impagliazzo and Rex Lei and Toniann Pitassi and Satchit Sivakumar and Jessica Sorrell}, editor = {Barna Saha and Rocco A. Servedio}, title = {Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization}, booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing, {STOC} 2023, Orlando, FL, USA, June 20-23, 2023}, pages = {520--527}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3564246.3585246}, doi = {10.1145/3564246.3585246}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BunGHILPSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tqc/BunV23, author = {Mark Bun and Nadezhda Voronova}, editor = {Omar Fawzi and Michael Walter}, title = {Approximate Degree Lower Bounds for Oracle Identification Problems}, booktitle = {18th Conference on the Theory of Quantum Computation, Communication and Cryptography, {TQC} 2023, July 24-28, 2023, Aveiro, Portugal}, series = {LIPIcs}, volume = {266}, pages = {1:1--1:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.TQC.2023.1}, doi = {10.4230/LIPICS.TQC.2023.1}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/tqc/BunV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2301-08324, author = {Shurong Lin and Mark Bun and Marco Gaboardi and Eric D. Kolaczyk and Adam Smith}, title = {Differentially Private Confidence Intervals for Proportions under Stratified Random Sampling}, journal = {CoRR}, volume = {abs/2301.08324}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2301.08324}, doi = {10.48550/ARXIV.2301.08324}, eprinttype = {arXiv}, eprint = {2301.08324}, timestamp = {Wed, 10 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2301-08324.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2303-03921, author = {Mark Bun and Nadezhda Voronova}, title = {Approximate degree lower bounds for oracle identification problems}, journal = {CoRR}, volume = {abs/2303.03921}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2303.03921}, doi = {10.48550/ARXIV.2303.03921}, eprinttype = {arXiv}, eprint = {2303.03921}, timestamp = {Wed, 15 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2303-03921.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2303-12921, author = {Mark Bun and Marco Gaboardi and Max Hopkins and Russell Impagliazzo and Rex Lei and Toniann Pitassi and Satchit Sivakumar and Jessica Sorrell}, title = {Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization}, journal = {CoRR}, volume = {abs/2303.12921}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2303.12921}, doi = {10.48550/ARXIV.2303.12921}, eprinttype = {arXiv}, eprint = {2303.12921}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2303-12921.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-07884, author = {Mark Bun and Marco Gaboardi and Marcel Neunhoeffer and Wanrong Zhang}, title = {Continual Release of Differentially Private Synthetic Data}, journal = {CoRR}, volume = {abs/2306.07884}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.07884}, doi = {10.48550/ARXIV.2306.07884}, eprinttype = {arXiv}, eprint = {2306.07884}, timestamp = {Sat, 17 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-07884.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2309-04642, author = {Mark Bun and Marco Gaboardi and Ludmila Glinskih}, title = {The Complexity of Verifying Boolean Programs as Differentially Private}, journal = {CoRR}, volume = {abs/2309.04642}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2309.04642}, doi = {10.48550/ARXIV.2309.04642}, eprinttype = {arXiv}, eprint = {2309.04642}, timestamp = {Fri, 15 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-04642.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunV23, author = {Mark Bun and Nadezhda Voronova}, title = {Approximate degree lower bounds for oracle identification problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-024}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/024}, eprinttype = {ECCC}, eprint = {TR23-024}, timestamp = {Tue, 13 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/BunT22, author = {Mark Bun and Justin Thaler}, title = {Approximate Degree in Classical and Quantum Computing}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {15}, number = {3-4}, pages = {229--423}, year = {2022}, url = {https://doi.org/10.1561/0400000107}, doi = {10.1561/0400000107}, timestamp = {Thu, 26 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fttcs/BunT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AlonBLMM22, author = {Noga Alon and Mark Bun and Roi Livni and Maryanthe Malliaris and Shay Moran}, title = {Private and Online Learnability Are Equivalent}, journal = {J. {ACM}}, volume = {69}, number = {4}, pages = {28:1--28:34}, year = {2022}, url = {https://doi.org/10.1145/3526074}, doi = {10.1145/3526074}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/AlonBLMM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BrownBS22, author = {Gavin Brown and Mark Bun and Adam D. Smith}, editor = {Po{-}Ling Loh and Maxim Raginsky}, title = {Strong Memory Lower Bounds for Learning Natural Models}, booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}}, series = {Proceedings of Machine Learning Research}, volume = {178}, pages = {4989--5029}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v178/brown22a.html}, timestamp = {Tue, 20 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BrownBS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csfw/BunGG22, author = {Mark Bun and Marco Gaboardi and Ludmila Glinskih}, title = {The Complexity of Verifying Boolean Programs as Differentially Private}, booktitle = {35th {IEEE} Computer Security Foundations Symposium, {CSF} 2022, Haifa, Israel, August 7-10, 2022}, pages = {396--411}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/CSF54842.2022.9919653}, doi = {10.1109/CSF54842.2022.9919653}, timestamp = {Fri, 11 Nov 2022 16:53:14 +0100}, biburl = {https://dblp.org/rec/conf/csfw/BunGG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/forc/BunDGMS22, author = {Mark Bun and J{\"{o}}rg Drechsler and Marco Gaboardi and Audra McMillan and Jayshree Sarathy}, editor = {L. Elisa Celis}, title = {Controlling Privacy Loss in Sampling Schemes: An Analysis of Stratified and Cluster Sampling}, booktitle = {3rd Symposium on Foundations of Responsible Computing, {FORC} 2022, June 6-8, 2022, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {218}, pages = {1:1--1:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.FORC.2022.1}, doi = {10.4230/LIPICS.FORC.2022.1}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/forc/BunDGMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-04743, author = {Gavin Brown and Mark Bun and Adam D. Smith}, title = {Strong Memory Lower Bounds for Learning Natural Models}, journal = {CoRR}, volume = {abs/2206.04743}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.04743}, doi = {10.48550/ARXIV.2206.04743}, eprinttype = {arXiv}, eprint = {2206.04743}, timestamp = {Tue, 20 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-04743.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/quantum/BunKT21, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {Quantum algorithms and approximating polynomials for composed functions with shared inputs}, journal = {Quantum}, volume = {5}, pages = {543}, year = {2021}, url = {https://doi.org/10.22331/q-2021-09-16-543}, doi = {10.22331/Q-2021-09-16-543}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/quantum/BunKT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BunKSW21, author = {Mark Bun and Gautam Kamath and Thomas Steinke and Zhiwei Steven Wu}, title = {Private Hypothesis Selection}, journal = {{IEEE} Trans. Inf. Theory}, volume = {67}, number = {3}, pages = {1981--2000}, year = {2021}, url = {https://doi.org/10.1109/TIT.2021.3049802}, doi = {10.1109/TIT.2021.3049802}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BunKSW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BunT21, author = {Mark Bun and Justin Thaler}, title = {The Large-Error Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {Theory Comput.}, volume = {17}, pages = {1--46}, year = {2021}, url = {https://theoryofcomputing.org/articles/v017a007/}, timestamp = {Tue, 07 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/BunT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/BunMT21, author = {Mark Bun and Nikhil S. Mande and Justin Thaler}, title = {Sign-rank Can Increase under Intersection}, journal = {{ACM} Trans. Comput. Theory}, volume = {13}, number = {4}, pages = {24:1--24:17}, year = {2021}, url = {https://doi.org/10.1145/3470863}, doi = {10.1145/3470863}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toct/BunMT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/Bun0K21, author = {Mark Bun and Marek Eli{\'{a}}s and Janardhan Kulkarni}, editor = {Marina Meila and Tong Zhang}, title = {Differentially Private Correlation Clustering}, booktitle = {Proceedings of the 38th International Conference on Machine Learning, {ICML} 2021, 18-24 July 2021, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {139}, pages = {1136--1146}, publisher = {{PMLR}}, year = {2021}, url = {http://proceedings.mlr.press/v139/bun21a.html}, timestamp = {Wed, 25 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/Bun0K21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/SivakumarBG21, author = {Satchit Sivakumar and Mark Bun and Marco Gaboardi}, editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan}, title = {Multiclass versus Binary Differentially Private {PAC} Learning}, booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual}, pages = {22943--22954}, year = {2021}, url = {https://proceedings.neurips.cc/paper/2021/hash/c1d53b7a97707b5cd1815c8d228d8ef1-Abstract.html}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/SivakumarBG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BrownBFST21, author = {Gavin Brown and Mark Bun and Vitaly Feldman and Adam D. Smith and Kunal Talwar}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {When is memorization of irrelevant training data necessary for high-accuracy learning?}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {123--132}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451131}, doi = {10.1145/3406325.3451131}, timestamp = {Tue, 20 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BrownBFST21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-08885, author = {Mark Bun and Marek Eli{\'{a}}s and Janardhan Kulkarni}, title = {Differentially Private Correlation Clustering}, journal = {CoRR}, volume = {abs/2102.08885}, year = {2021}, url = {https://arxiv.org/abs/2102.08885}, eprinttype = {arXiv}, eprint = {2102.08885}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-08885.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-10870, author = {Mark Bun and Marco Gaboardi and Satchit Sivakumar}, title = {Multiclass versus Binary Differentially Private {PAC} Learning}, journal = {CoRR}, volume = {abs/2107.10870}, year = {2021}, url = {https://arxiv.org/abs/2107.10870}, eprinttype = {arXiv}, eprint = {2107.10870}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-10870.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BunT20, author = {Mark Bun and Justin Thaler}, title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1161737}, doi = {10.1137/17M1161737}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BunT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/BunT20, author = {Mark Bun and Justin Thaler}, title = {Guest Column: Approximate Degree in Classical and Quantum Computing}, journal = {{SIGACT} News}, volume = {51}, number = {4}, pages = {48--72}, year = {2020}, url = {https://doi.org/10.1145/3444815.3444825}, doi = {10.1145/3444815.3444825}, timestamp = {Fri, 05 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/BunT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BunKT20, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials}, journal = {Theory Comput.}, volume = {16}, pages = {1--71}, year = {2020}, url = {https://doi.org/10.4086/toc.2020.v016a010}, doi = {10.4086/TOC.2020.V016A010}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/BunKT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BunCS20, author = {Mark Bun and Marco Leandro Carmosino and Jessica Sorrell}, editor = {Jacob D. Abernethy and Shivani Agarwal}, title = {Efficient, Noise-Tolerant, and Private Learning via Boosting}, booktitle = {Conference on Learning Theory, {COLT} 2020, 9-12 July 2020, Virtual Event [Graz, Austria]}, series = {Proceedings of Machine Learning Research}, volume = {125}, pages = {1031--1077}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v125/bun20a.html}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/BunCS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BunLM20, author = {Mark Bun and Roi Livni and Shay Moran}, editor = {Sandy Irani}, title = {An Equivalence Between Private Classification and Online Prediction}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {389--402}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00044}, doi = {10.1109/FOCS46700.2020.00044}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/BunLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/VietriTBSW20, author = {Giuseppe Vietri and Grace Tian and Mark Bun and Thomas Steinke and Zhiwei Steven Wu}, title = {New Oracle-Efficient Algorithms for Private Synthetic Data Release}, booktitle = {Proceedings of the 37th International Conference on Machine Learning, {ICML} 2020, 13-18 July 2020, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {119}, pages = {9765--9774}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v119/vietri20b.html}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/VietriTBSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/Bun20, author = {Mark Bun}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {A Computational Separation between Private Learning and Online Learning}, booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual}, year = {2020}, url = {https://proceedings.neurips.cc/paper/2020/hash/ee715daa76f1b51d80343f45547be570-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/Bun20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-01100, author = {Mark Bun and Marco Leandro Carmosino and Jessica Sorrell}, title = {Efficient, Noise-Tolerant, and Private Learning via Boosting}, journal = {CoRR}, volume = {abs/2002.01100}, year = {2020}, url = {https://arxiv.org/abs/2002.01100}, eprinttype = {arXiv}, eprint = {2002.01100}, timestamp = {Mon, 10 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-01100.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2003-00563, author = {Mark Bun and Roi Livni and Shay Moran}, title = {An Equivalence Between Private Classification and Online Prediction}, journal = {CoRR}, volume = {abs/2003.00563}, year = {2020}, url = {https://arxiv.org/abs/2003.00563}, eprinttype = {arXiv}, eprint = {2003.00563}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2003-00563.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-05453, author = {Giuseppe Vietri and Grace Tian and Mark Bun and Thomas Steinke and Zhiwei Steven Wu}, title = {New Oracle-Efficient Algorithms for Private Synthetic Data Release}, journal = {CoRR}, volume = {abs/2007.05453}, year = {2020}, url = {https://arxiv.org/abs/2007.05453}, eprinttype = {arXiv}, eprint = {2007.05453}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-05453.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-05665, author = {Mark Bun}, title = {A Computational Separation between Private Learning and Online Learning}, journal = {CoRR}, volume = {abs/2007.05665}, year = {2020}, url = {https://arxiv.org/abs/2007.05665}, eprinttype = {arXiv}, eprint = {2007.05665}, timestamp = {Mon, 20 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-05665.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-12674, author = {Mark Bun and J{\"{o}}rg Drechsler and Marco Gaboardi and Audra McMillan}, title = {Controlling Privacy Loss in Survey Sampling (Working Paper)}, journal = {CoRR}, volume = {abs/2007.12674}, year = {2020}, url = {https://arxiv.org/abs/2007.12674}, eprinttype = {arXiv}, eprint = {2007.12674}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-12674.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-06421, author = {Gavin Brown and Mark Bun and Vitaly Feldman and Adam D. Smith and Kunal Talwar}, title = {When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?}, journal = {CoRR}, volume = {abs/2012.06421}, year = {2020}, url = {https://arxiv.org/abs/2012.06421}, eprinttype = {arXiv}, eprint = {2012.06421}, timestamp = {Tue, 20 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-06421.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/BunNS19, author = {Mark Bun and Kobbi Nissim and Uri Stemmer}, title = {Simultaneous Private Learning of Multiple Concepts}, journal = {J. Mach. Learn. Res.}, volume = {20}, pages = {94:1--94:34}, year = {2019}, url = {https://jmlr.org/papers/v20/18-549.html}, timestamp = {Wed, 11 Sep 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/BunNS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jpc/BunSU19, author = {Mark Bun and Thomas Steinke and Jonathan R. Ullman}, title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy}, journal = {J. Priv. Confidentiality}, volume = {9}, number = {1}, year = {2019}, url = {https://doi.org/10.29012/jpc.655}, doi = {10.29012/JPC.655}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jpc/BunSU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BunNS19, author = {Mark Bun and Jelani Nelson and Uri Stemmer}, title = {Heavy Hitters and the Structure of Local Privacy}, journal = {{ACM} Trans. Algorithms}, volume = {15}, number = {4}, pages = {51:1--51:40}, year = {2019}, url = {https://doi.org/10.1145/3344722}, doi = {10.1145/3344722}, timestamp = {Wed, 23 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BunNS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BunT19, author = {Mark Bun and Justin Thaler}, editor = {Dimitris Achlioptas and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, title = {The Large-Error Approximate Degree of AC\({}^{\mbox{0}}\)}, 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 = {55:1--55:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.55}, doi = {10.4230/LIPICS.APPROX-RANDOM.2019.55}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/BunT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BunMT19, author = {Mark Bun and Nikhil S. Mande and Justin Thaler}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {Sign-Rank Can Increase Under Intersection}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {30:1--30:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.30}, doi = {10.4230/LIPICS.ICALP.2019.30}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BunMT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/Bun0SW19, author = {Mark Bun and Gautam Kamath and Thomas Steinke and Zhiwei Steven Wu}, editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alch{\'{e}}{-}Buc and Emily B. Fox and Roman Garnett}, title = {Private Hypothesis Selection}, booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada}, pages = {156--167}, year = {2019}, url = {https://proceedings.neurips.cc/paper/2019/hash/9778d5d219c5080b9a6a17bef029331c-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/Bun0SW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BunS19, author = {Mark Bun and Thomas Steinke}, editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alch{\'{e}}{-}Buc and Emily B. Fox and Roman Garnett}, title = {Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation}, booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada}, pages = {181--191}, year = {2019}, url = {https://proceedings.neurips.cc/paper/2019/hash/3ef815416f775098fe977004015c6193-Abstract.html}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/BunS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BunKT19, author = {Mark Bun and Robin Kothari and Justin Thaler}, editor = {Timothy M. Chan}, title = {Quantum algorithms and approximating polynomials for composed functions with shared inputs}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {662--678}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.42}, doi = {10.1137/1.9781611975482.42}, timestamp = {Thu, 15 Jul 2021 13:49:01 +0200}, biburl = {https://dblp.org/rec/conf/soda/BunKT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BlasiokBNS19, author = {Jaroslaw Blasiok and Mark Bun and Aleksandar Nikolov and Thomas Steinke}, editor = {Timothy M. Chan}, title = {Towards Instance-Optimal Private Query Release}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2480--2497}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.152}, doi = {10.1137/1.9781611975482.152}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BlasiokBNS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1903-00544, author = {Mark Bun and Nikhil S. Mande and Justin Thaler}, title = {Sign-Rank Can Increase Under Intersection}, journal = {CoRR}, volume = {abs/1903.00544}, year = {2019}, url = {http://arxiv.org/abs/1903.00544}, eprinttype = {arXiv}, eprint = {1903.00544}, timestamp = {Sat, 30 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1903-00544.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1905-13229, author = {Mark Bun and Gautam Kamath and Thomas Steinke and Zhiwei Steven Wu}, title = {Private Hypothesis Selection}, journal = {CoRR}, volume = {abs/1905.13229}, year = {2019}, url = {http://arxiv.org/abs/1905.13229}, eprinttype = {arXiv}, eprint = {1905.13229}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1905-13229.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-02830, author = {Mark Bun and Thomas Steinke}, title = {Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation}, journal = {CoRR}, volume = {abs/1906.02830}, year = {2019}, url = {http://arxiv.org/abs/1906.02830}, eprinttype = {arXiv}, eprint = {1906.02830}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-02830.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunMT19, author = {Mark Bun and Nikhil S. Mande and Justin Thaler}, title = {Sign-Rank Can Increase Under Intersection}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-027}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/027}, eprinttype = {ECCC}, eprint = {TR19-027}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunMT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BunUV18, author = {Mark Bun and Jonathan R. Ullman and Salil P. Vadhan}, title = {Fingerprinting Codes and the Price of Approximate Differential Privacy}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {5}, pages = {1888--1938}, year = {2018}, url = {https://doi.org/10.1137/15M1033587}, doi = {10.1137/15M1033587}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BunUV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BunT18, author = {Mark Bun and Justin Thaler}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {Approximate Degree and the Complexity of Depth Three 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 = {35:1--35:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.35}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.35}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/BunT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pods/BunNS18, author = {Mark Bun and Jelani Nelson and Uri Stemmer}, editor = {Jan Van den Bussche and Marcelo Arenas}, title = {Heavy Hitters and the Structure of Local Privacy}, booktitle = {Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018}, pages = {435--447}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3196959.3196981}, doi = {10.1145/3196959.3196981}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/pods/BunNS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunDRS18, author = {Mark Bun and Cynthia Dwork and Guy N. Rothblum and Thomas Steinke}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Composable and versatile privacy via truncated {CDP}}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {74--86}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188946}, doi = {10.1145/3188745.3188946}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BunDRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunKT18, author = {Mark Bun and Robin Kothari and Justin Thaler}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The polynomial method strikes back: tight quantum query bounds via dual polynomials}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {297--310}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188784}, doi = {10.1145/3188745.3188784}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BunKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-02254, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {Quantum algorithms and approximating polynomials for composed functions with shared inputs}, journal = {CoRR}, volume = {abs/1809.02254}, year = {2018}, url = {http://arxiv.org/abs/1809.02254}, eprinttype = {arXiv}, eprint = {1809.02254}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-02254.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1811-03763, author = {Jaroslaw Blasiok and Mark Bun and Aleksandar Nikolov and Thomas Steinke}, title = {Towards Instance-Optimal Private Query Release}, journal = {CoRR}, volume = {abs/1811.03763}, year = {2018}, url = {http://arxiv.org/abs/1811.03763}, eprinttype = {arXiv}, eprint = {1811.03763}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1811-03763.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunKT18, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {Quantum algorithms and approximating polynomials for composed functions with shared inputs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-156}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/156}, eprinttype = {ECCC}, eprint = {TR18-156}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT18, author = {Mark Bun and Justin Thaler}, title = {The Large-Error Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-143}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/143}, eprinttype = {ECCC}, eprint = {TR18-143}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BunT17, author = {Mark Bun and Justin Thaler}, editor = {Chris Umans}, title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {1--12}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.10}, doi = {10.1109/FOCS.2017.10}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BunT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/MitrovicB0K17, author = {Marko Mitrovic and Mark Bun and Andreas Krause and Amin Karbasi}, editor = {Doina Precup and Yee Whye Teh}, title = {Differentially Private Submodular Maximization: Data Summarization in Disguise}, booktitle = {Proceedings of the 34th International Conference on Machine Learning, {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017}, series = {Proceedings of Machine Learning Research}, volume = {70}, pages = {2478--2487}, publisher = {{PMLR}}, year = {2017}, url = {http://proceedings.mlr.press/v70/mitrovic17a.html}, timestamp = {Wed, 29 May 2019 08:41:45 +0200}, biburl = {https://dblp.org/rec/conf/icml/MitrovicB0K17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BunSU17, author = {Mark Bun and Thomas Steinke and Jonathan R. Ullman}, editor = {Philip N. Klein}, title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1306--1325}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.85}, doi = {10.1137/1.9781611974782.85}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BunSU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunT17, author = {Mark Bun and Justin Thaler}, title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {CoRR}, volume = {abs/1703.05784}, year = {2017}, url = {http://arxiv.org/abs/1703.05784}, eprinttype = {arXiv}, eprint = {1703.05784}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-09079, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials}, journal = {CoRR}, volume = {abs/1710.09079}, year = {2017}, url = {http://arxiv.org/abs/1710.09079}, eprinttype = {arXiv}, eprint = {1710.09079}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-09079.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-04740, author = {Mark Bun and Jelani Nelson and Uri Stemmer}, title = {Heavy Hitters and the Structure of Local Privacy}, journal = {CoRR}, volume = {abs/1711.04740}, year = {2017}, url = {http://arxiv.org/abs/1711.04740}, eprinttype = {arXiv}, eprint = {1711.04740}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-04740.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunKT17, author = {Mark Bun and Robin Kothari and Justin Thaler}, title = {The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-169}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/169}, eprinttype = {ECCC}, eprint = {TR17-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunKT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT17, author = {Mark Bun and Justin Thaler}, title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-051}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/051}, eprinttype = {ECCC}, eprint = {TR17-051}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BunT16, author = {Mark Bun and Justin Thaler}, title = {Dual Polynomials for Collision and Element Distinctness}, journal = {Theory Comput.}, volume = {12}, number = {1}, pages = {1--34}, year = {2016}, url = {https://doi.org/10.4086/toc.2016.v012a016}, doi = {10.4086/TOC.2016.V012A016}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/BunT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BunT16, author = {Mark Bun and Justin Thaler}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Improved Bounds on the Sign-Rank of AC{\^{}}0}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {37:1--37:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.37}, doi = {10.4230/LIPICS.ICALP.2016.37}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BunT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BunNS16, author = {Mark Bun and Kobbi Nissim and Uri Stemmer}, editor = {Madhu Sudan}, title = {Simultaneous Private Learning of Multiple Concepts}, booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016}, pages = {369--380}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2840728.2840747}, doi = {10.1145/2840728.2840747}, timestamp = {Tue, 14 Jun 2022 13:12:41 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BunNS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/BunZ16, author = {Mark Bun and Mark Zhandry}, editor = {Eyal Kushilevitz and Tal Malkin}, title = {Order-Revealing Encryption and the Hardness of Private Learning}, 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 = {176--206}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49096-9\_8}, doi = {10.1007/978-3-662-49096-9\_8}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/tcc/BunZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/BunCV16, author = {Mark Bun and Yi{-}Hsiu Chen and Salil P. Vadhan}, editor = {Martin Hirt and Adam D. Smith}, title = {Separating Computational and Statistical Differential Privacy in the Client-Server 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 = {607--634}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53641-4\_23}, doi = {10.1007/978-3-662-53641-4\_23}, timestamp = {Tue, 20 Aug 2024 08:48:08 +0200}, biburl = {https://dblp.org/rec/conf/tcc/BunCV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/BunS16, author = {Mark Bun and Thomas Steinke}, editor = {Martin Hirt and Adam D. Smith}, title = {Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds}, 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 = {635--658}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53641-4\_24}, doi = {10.1007/978-3-662-53641-4\_24}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tcc/BunS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunSU16, author = {Mark Bun and Thomas Steinke and Jonathan R. Ullman}, title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy}, journal = {CoRR}, volume = {abs/1604.04618}, year = {2016}, url = {http://arxiv.org/abs/1604.04618}, eprinttype = {arXiv}, eprint = {1604.04618}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BunSU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunS16, author = {Mark Bun and Thomas Steinke}, title = {Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds}, journal = {CoRR}, volume = {abs/1605.02065}, year = {2016}, url = {http://arxiv.org/abs/1605.02065}, eprinttype = {arXiv}, eprint = {1605.02065}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BunS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT16, author = {Mark Bun and Justin Thaler}, title = {Improved Bounds on the Sign-Rank of AC\({}^{\mbox{0}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-075}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/075}, eprinttype = {ECCC}, eprint = {TR16-075}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT16a, author = {Mark Bun and Justin Thaler}, title = {Approximate Degree and the Complexity of Depth Three Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-121}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/121}, eprinttype = {ECCC}, eprint = {TR16-121}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BunS16, author = {Mark Bun and Thomas Steinke}, title = {Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {816}, year = {2016}, url = {http://eprint.iacr.org/2016/816}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/BunS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BunCV16, author = {Mark Bun and Yi{-}Hsiu Chen and Salil P. Vadhan}, title = {Separating Computational and Statistical Differential Privacy in the Client-Server Model}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {820}, year = {2016}, url = {http://eprint.iacr.org/2016/820}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/BunCV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BunT15, author = {Mark Bun and Justin Thaler}, title = {Dual lower bounds for approximate degree and Markov-Bernstein inequalities}, journal = {Inf. Comput.}, volume = {243}, pages = {2--25}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.12.003}, doi = {10.1016/J.IC.2014.12.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BunT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BunS15, author = {Mark Bun and Thomas Steinke}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'{e}} D. P. Rolim}, title = {Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {40}, pages = {625--644}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.625}, doi = {10.4230/LIPICS.APPROX-RANDOM.2015.625}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/BunS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BunNSV15, author = {Mark Bun and Kobbi Nissim and Uri Stemmer and Salil P. Vadhan}, editor = {Venkatesan Guruswami}, title = {Differentially Private Release and Learning of Threshold Functions}, booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS} 2015, Berkeley, CA, USA, 17-20 October, 2015}, pages = {634--649}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/FOCS.2015.45}, doi = {10.1109/FOCS.2015.45}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BunNSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BunT15, author = {Mark Bun and Justin Thaler}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {Hardness Amplification and the Approximate Degree of Constant-Depth Circuits}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9134}, pages = {268--280}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47672-7\_22}, doi = {10.1007/978-3-662-47672-7\_22}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BunT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunT15, author = {Mark Bun and Justin Thaler}, title = {Dual Polynomials for Collision and Element Distinctness}, journal = {CoRR}, volume = {abs/1503.07261}, year = {2015}, url = {http://arxiv.org/abs/1503.07261}, eprinttype = {arXiv}, eprint = {1503.07261}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunNSV15, author = {Mark Bun and Kobbi Nissim and Uri Stemmer and Salil P. Vadhan}, title = {Differentially Private Release and Learning of Threshold Functions}, journal = {CoRR}, volume = {abs/1504.07553}, year = {2015}, url = {http://arxiv.org/abs/1504.07553}, eprinttype = {arXiv}, eprint = {1504.07553}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunNSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunZ15, author = {Mark Bun and Mark Zhandry}, title = {Order-Revealing Encryption and the Hardness of Private Learning}, journal = {CoRR}, volume = {abs/1505.00388}, year = {2015}, url = {http://arxiv.org/abs/1505.00388}, eprinttype = {arXiv}, eprint = {1505.00388}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunNS15, author = {Mark Bun and Kobbi Nissim and Uri Stemmer}, title = {Simultaneous Private Learning of Multiple Concepts}, journal = {CoRR}, volume = {abs/1511.08552}, year = {2015}, url = {http://arxiv.org/abs/1511.08552}, eprinttype = {arXiv}, eprint = {1511.08552}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunNS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT15, author = {Mark Bun and Justin Thaler}, title = {Dual Polynomials for Collision and Element Distinctness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-041}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/041}, eprinttype = {ECCC}, eprint = {TR15-041}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BunZ15, author = {Mark Bun and Mark Zhandry}, title = {Order-Revealing Encryption and the Hardness of Private Learning}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {417}, year = {2015}, url = {http://eprint.iacr.org/2015/417}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/BunZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunUV14, author = {Mark Bun and Jonathan R. Ullman and Salil P. Vadhan}, editor = {David B. Shmoys}, title = {Fingerprinting codes and the price of approximate differential privacy}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {1--10}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591877}, doi = {10.1145/2591796.2591877}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BunUV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunS14, author = {Mark Bun and Thomas Steinke}, title = {Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness}, journal = {CoRR}, volume = {abs/1412.2457}, year = {2014}, url = {http://arxiv.org/abs/1412.2457}, eprinttype = {arXiv}, eprint = {1412.2457}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BunS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunS14, author = {Mark Bun and Thomas Steinke}, title = {Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-166}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/166}, eprinttype = {ECCC}, eprint = {TR14-166}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BunT13, author = {Mark Bun and Justin Thaler}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7965}, pages = {303--314}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39206-1\_26}, doi = {10.1007/978-3-642-39206-1\_26}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BunT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1302-6191, author = {Mark Bun and Justin Thaler}, title = {Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities}, journal = {CoRR}, volume = {abs/1302.6191}, year = {2013}, url = {http://arxiv.org/abs/1302.6191}, eprinttype = {arXiv}, eprint = {1302.6191}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1302-6191.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunT13, author = {Mark Bun and Justin Thaler}, title = {Hardness Amplification and the Approximate Degree of Constant-Depth Circuits}, journal = {CoRR}, volume = {abs/1311.1616}, year = {2013}, url = {http://arxiv.org/abs/1311.1616}, eprinttype = {arXiv}, eprint = {1311.1616}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BunT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BunUV13, author = {Mark Bun and Jonathan R. Ullman and Salil P. Vadhan}, title = {Fingerprinting Codes and the Price of Approximate Differential Privacy}, journal = {CoRR}, volume = {abs/1311.3158}, year = {2013}, url = {http://arxiv.org/abs/1311.3158}, eprinttype = {arXiv}, eprint = {1311.3158}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BunUV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT13, author = {Mark Bun and Justin Thaler}, title = {Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-032}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/032}, eprinttype = {ECCC}, eprint = {TR13-032}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BunT13a, author = {Mark Bun and Justin Thaler}, title = {Hardness Amplification and the Approximate Degree of Constant-Depth Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-151}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/151}, eprinttype = {ECCC}, eprint = {TR13-151}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BunT13a.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.