Mark Bun

Mark Bun

PhD student (NDSEG fellowship), Theory of Computation group, Harvard
Mark Bun

PhD student Mark Bun is involved in the Privacy Tool's differential privacy work and de-identification meetings, working on differentially private algorithms and lower bounds. He has previously served as a teaching fellow for PI Vadhan's Cryptography course in Fall 2013, and as a teaching fellow for Differential Privacy in Fall 2014, assisting Visiting Scholar Kobbi Nissim and Fellow Or Sheffet. Alongside Visiting Scholar Nissim, Mark mentored two undergraduate REU students in 2014 (Victor Balcer and Nathan Manohar). In summer 2015, Mark co-mentored REU student Daniel Muise with Kobbi Nissim and Victor Balcer, who returned as a graduate student.

5Recent Publications

  • M. Bun and Thaler, J., “Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities,” Automata, Languages, and Programming, , vol. 7965, pp. 303-314, 2013.AbstractPDF

Poster Presentation

NSF Site Visit, December 2014

Mark Bun

NSF Site Visit, November 2013

Mark Bun

Websites