Mark Bun

Computer Science 416
35 Olden Street
Princeton, NJ 08540-5233
mbun [at] cs [dot] princeton [dot] edu

I am a postdoctoral researcher in the Theory of Computation Group at Princeton University, where I am hosted by Mark Zhandry. Before coming to Princeton, I completed my Ph.D. in computer science at Harvard University in November 2016, where I was very fortunate to have Salil Vadhan as my advisor. As an undergraduate, I studied math and computer science at the University of Washington.

I am broadly interested in theoretical computer science, including data privacy, computational complexity, cryptography, and the foundations of machine learning. My current research focuses on

  1. Using the methodologies of complexity theory to answer practically-motivated questions in algorithmic data privacy, and

  2. Understanding the power of real polynomial approximations to Boolean functions and their applications in quantum computation, communication complexity, and learning theory.

[CV]   [Research Statement]   [Teaching Statement]

Research Papers

Other Manuscripts


At Harvard:

In Fall 2014, I was a teaching fellow for Differential Privacy (CS 227r).
In Fall 2013, I was a teaching fellow for Intro to Cryptography (CS 127).

At UW:

In Spring 2012, I was a teaching assistant for Foundations of Computing II (CSE 312).
For the 2011-12 academic year, I was a teaching assistant for Accelerated (Honors) Advanced Calculus (Math 334/5/6).
For the 2010-11 academic year, I was a teaching assistant for Accelerated (Honors) Calculus (Math 134/5/6).