Professor
Mark Braverman has been awarded the
2016 Presburger Award by The European Association for Theoretical Computer Science. This award is given to young scientists for a published paper or series of papers documenting outstanding contributions to theoretical computer science. Professor Braverman is being recognized for fundamental results in complexity theory, the theory of computation over the reals, approximation algorithms, computational learning theory, information theory, algorithmic economics, pseudorandomness and communication complexity he has achieved. The award will be delivered at
ICALP 2016 in Rome, Italy.
