Michael’s research is in theoretical computer science, with a focus on approximation algorithms, online algorithms, distributed algorithms, and hardness of approximation. He is also interested in applications of theory, particularly to computer networking and distributed systems. He obtained his Ph.D. from Carnegie Mellon University in 2010 and his A.B. from Princeton University in 2005. Before coming to Johns Hopkins he was a postdoctoral fellow at the Weizmann Institute of Science in Rehovot, Israel.