معرفی
Benjamin Rossman is an Associate Professor in the Computer Science and Mathematics Departments at Duke University, affiliated with the Theory Group. His research focuses on computational complexity, particularly circuit complexity and finite model theory, with notable contributions to lower bounds for subgraph isomorphism problems and logical definability. Rossman earned his Ph.D. from MIT under Madhu Sudan's supervision. He has held faculty positions at the University of Toronto and postdoctoral roles at the Tokyo Institute of Technology and National Institute of Informatics in Japan.
He has received prestigious awards including the Alfred P. Sloan Fellowship and NSERC grants. His teaching includes courses on computational complexity, mathematical logic, and discrete mathematics. Recent publications explore homomorphism preservation theorems, formula complexity, and treedepth in subgraph isomorphism.
Rossman advises graduate students in theoretical computer science and has led research on circuit lower bounds, algorithmic logic, and combinatorial complexity. His work bridges foundational theory with practical algorithmic challenges, contributing to the understanding of computational limits in combinatorial problems.
