Faculty Profiles

Shachar Lovett

Associate Professor, CSE

Computational complexity, coding theory, randomness and pseudo-randomness, explicit constructions

Shachar Lovett is a mathematician who studies the foundations of computer science: Which computational problems can be efficiently solved? Which problems cannot be solved, and why? Lovett’s work touches on and studies the inter-relations between many areas, including: algorithms, computational complexity, coding theory, randomness in computation, data structures and communication protocols. Lovett is particularly interested in connections between these areas and the emerging field of additive combinatorics.

Capsule Bio:

Postdoctoral researcher at The Institute for Advanced Study in Princeton, N.J., 2010-12. Ph.D. in computer science from The Weizmann Institute  of Science, in Rehovot, Israel, 2010.

Update your profile

Photo of Shachar Lovett


Office Phone: