Mark Bun

ScholarGPS® ID: 29093881379812

Affiliation

Boston University, Boston, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Privacy | Cryptography

Metrics Summary

Publication Count

Predicted Citations

925

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections (journal article) Bun, Mark \| Gaboardi, Marco \| Neunhoeffer, Marcel \| Zhang, Wanrong Proceedings of the ACM on Management of Data, volume 2, issue 2, pages 1-26 (2024). 10.1145/3651595 Cite \| Source
Differentially private confidence intervals for proportions under stratified random sampling (journal article) Lin, Shurong \| Bun, Mark \| Gaboardi, Marco \| Kolaczyk, Eric D. \| Smith, Adam Electronic Journal of Statistics, volume 18, issue 1 (2024). 10.1214/24-EJS2234 Cite \| Source
Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization (conference) Bun, Mark \| Gaboardi, Marco \| Hopkins, Max \| Impagliazzo, Russell \| Lei, Rex \| Pitassi, Toniann \| Sivakumar, Satchit \| Sorrell, Jessica STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585246 Cited by (1) \| Cite \| Source
Private and Online Learnability Are Equivalent (journal article) Alon, Noga \| Bun, Mark \| Livni, Roi \| Malliaris, Maryanthe \| Moran, Shay Journal of the ACM, volume 69, issue 4, pages 1-34 (2022). 10.1145/3526074 Cited by (3) \| Cite \| Source
The Complexity of Verifying Boolean Programs as Differentially Private (conference) Bun, Mark \| Gaboardi, Marco \| Glinskih, Ludmila 2022 IEEE 35th Computer Security Foundations Symposium (CSF) (2022) Haifa, Israel 10.1109/CSF54842.2022.9919653 Cited by (1) \| Cite \| Source
Approximate Degree in Classical and Quantum Computing (book) Bun, Mark \| Thaler, Justin Now Publishers (2022) 10.1561/9781638281412 Cite \| Source
Approximate Degree in Classical and Quantum Computing (journal article) Bun, Mark \| Thaler, Justin Foundations and Trends® in Theoretical Computer Science, volume 15, issue 3-4, pages 229-423 (2022). 10.1561/0400000107 Cite \| Source
Sign-rank Can Increase under Intersection (journal article) Bun, Mark \| Mande, Nikhil S. \| Thaler, Justin ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-17 (2021). 10.1145/3470863 Cite \| Source
Quantum algorithms and approximating polynomials for composed functions with shared inputs (journal article) Bun, Mark \| Kothari, Robin \| Thaler, Justin Quantum, volume 5 (2021). 10.22331/q-2021-09-16-543 Cite \| Source
When is memorization of irrelevant training data necessary for high-accuracy learning? (conference) Brown, Gavin \| Bun, Mark \| Feldman, Vitaly \| Smith, Adam \| Talwar, Kunal STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) Virtual Italy 10.1145/3406325.3451131 Cited by (15) \| Cite \| Source
Private Hypothesis Selection (journal article) Bun, Mark \| Kamath, Gautam \| Steinke, Thomas \| Wu, Zhiwei Steven IEEE Transactions on Information Theory, volume 67, issue 3, pages 1981-2000 (2021). 10.1109/TIT.2021.3049802 Cited by (8) \| Cite \| Source
Guest Column (journal article) Bun, Mark \| Thaler, Justin ACM SIGACT News, volume 51, issue 4, pages 48-72 (2020). 10.1145/3444815.3444825 Cited by (4) \| Cite \| Source
An Equivalence Between Private Classification and Online Prediction (conference) Bun, Mark \| Livni, Roi \| Moran, Shay 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00044 Cited by (14) \| Cite \| Source
A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (journal article) Bun, Mark \| Thaler, Justin SIAM Journal on Computing, volume 49, issue 4, pages FOCS17-59-FOCS17-96 (2020). 10.1137/17M1161737 Cited by (2) \| Cite \| Source
Heavy Hitters and the Structure of Local Privacy (journal article) Bun, Mark \| Nelson, Jelani \| Stemmer, Uri ACM Transactions on Algorithms, volume 15, issue 4, pages 1-40 (2019). 10.1145/3344722 Cited by (16) \| Cite \| Source
Make Up Your Mind: The Price of Online Queries in Differential Privacy (journal article) Bun, Mark \| Steinke, Thomas \| Ullman, Jonathan Journal of Privacy and Confidentiality, volume 9, issue 1 (2019). 10.29012/jpc.655 Cited by (2) \| Cite \| Source
Towards Instance-Optimal Private Query Release (book chapter) In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Błasiok, Jaroslaw \| Bun, Mark \| Nikolov, Aleksandar \| Steinke, Thomas Society for Industrial and Applied Mathematics (2019) 10.1137/1.9781611975482.152 Cited by (5) \| Cite \| Source
Quantum algorithms and approximating polynomials for composed functions with shared inputs (book chapter) In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Bun, Mark \| Kothari, Robin \| Thaler, Justin Society for Industrial and Applied Mathematics (2019) 10.1137/1.9781611975482.42 Cited by (7) \| Cite \| Source
Composable and versatile privacy via truncated CDP (conference) Bun, Mark \| Dwork, Cynthia \| Rothblum, Guy N. \| Steinke, Thomas STOC '18: Symposium on Theory of Computing (2018) Los Angeles CA USA 10.1145/3188745.3188946 Cited by (51) \| Cite \| Source
The polynomial method strikes back: tight quantum query bounds via dual polynomials (conference) Bun, Mark \| Kothari, Robin \| Thaler, Justin STOC '18: Symposium on Theory of Computing (2018) Los Angeles CA USA 10.1145/3188745.3188784 Cited by (20) \| Cite \| Source \| Open Access