Mark Braverman



I am a postdoctoral researcher at the Microsoft Research New England lab.
I received my PhD in 2008 from the
Dept. of Computer Science at the University of Toronto under the supervision of Stephen Cook.

I am interested in complexity theory, the theory of real computation, machine learning, algorithms, game theory, computational biology and medicine.

My e-mail address: #######@cs.toronto.edu, replacing "#######" with "mbraverm"

This year, I was on the PC of FOCS'09 and on the PC of CCA'09.


[NEW] Book: Computability of Julia Sets
  Mark Braverman, Michael Yampolsky
    Springer, 2008
  [Amazon]   [Springer]

Papers

 

All papers

By topic (with some overlap)

  Complexity theory
  Algorithms and random structures
  Economics, algorithmic game theory
  Computational Biology and Medicine
  Computability and complexity in analysis and dynamics


Selected recent papers

How to compress interactive communication
  Boaz Barak, Mark Braverman, Xi Chen, Anup Rao
    Submitted [pdf]
    Previous version [ECCC]
 
Phylogenetic Reconstruction with Insertions and Deletions
  Alex Andoni, Mark Braverman, Avinatan Hassidim
    Submitted [pdf]
 

Older links

Computability and Complexity in Analysis and Dynamics Seminar page

Theory Student Seminar is now organized by Siavosh Benabbas