[2] He received in 2011 his Ph.D. with advisor Madhu Sudan from MIT with thesis Average-Case Complexity of Detecting Cliques.
For the academic year 2014–2015 he was a Simons-Berkeley Research Fellow at the Simons Institute for the Theory of Computing.
[5] His research seeks to quantify the minimum resources required to solve basic problems in combinatorial models such as Boolean circuits.
Through creative techniques based in logic and the probabilistic method, Ben has derived groundbreaking lower bounds on the complexity of detecting cliques and determining connectivity in random graphs.
His other notable results include size and depth hierarchy theorems for bounded-depth circuits, answering longstanding questions.