He works in theoretical computer science and is also interested in coding theory and combinatorics. Most of Samorodnitsky’s work deals with investigating various properties of Boolean functions—very basic objects that can be interpreted as belonging to surprisingly many mathematical settings. Samorodnitsky studied at the Hebrew University in Jerusalem, where he earned his bachelor’s, master’s, and doctoral degrees. He was a postdoctoral fellow at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University and at the Institute for Advanced Study in Princeton, and a visiting scientist at Microsoft Research New England.