Esty Kelman

Postdoctoral fellow at CS and CDS at Boston University and CSAIL, MIT.

Supported in part by FODSI and hosted by Piotr Indyk, Krzysztof Onak, Sofya Raskhodnikova, and Ronitt Rubinfeld.

Research interests: Theoretical computer science, include computational complexity, probabilistically checkable proofs, and sublinear algorithms, in particular, property testing, alongside analysis of Boolean functions, and combinatorics.