Regular biography
Benjamin Rossman is an Associate Professor of Computer Science at Duke University, affiliated with the Mathematics Department and a member of the Theory Group. His research focuses on the structural properties of combinatorial problems and their impact on computational and descriptive complexity. Rossman has made significant contributions to establishing unconditional lower bounds in various circuit models for subgraph isomorphism problems, including clique and connectivity in random graphs. He previously held a faculty position at the University of Toronto and postdocs at the Tokyo Institute of Technology and National Institute of Informatics in Japan. Rossman completed his PhD at MIT under the supervision of Madhu Sudan. He teaches courses in computational complexity, mathematical logic, and circuit complexity.