Lorenzo Orecchia is an assistant professor in computer science at Boston University. Orecchia obtained his PhD in theoretical computer science at UC Berkeley under the supervision of Satish Rao in 2011, and was an applied mathematics instructor at MIT under the supervision of Jon Kelner until May 2014. He is interested in the interplay of convex and combinatorial optimization. In particular, he is currently focusing on the design of fast algorithms for fundamental combinatorial problems that rely on ideas from continuous optimization.