Benjamin Rossman, Associate Professor of Computer Science

My research interests lie in computational complexity and logic, specifically the areas of circuit complexity (the quest for lower bounds in combinatorial models of computation) and finite model theory (the study of logical definability on finite structures). My work is supported by NSERC Discovery and Accelerator Grants, the Ontario Early Researcher Award, and a Sloan Research Fellowship.

Office Location:	Room D110, LSRC, 308 Research Drive, Durham, NC 27708
Office Phone:	+1 919 660 6516
Email Address:
Web Page:	https://users.cs.duke.edu/~br148/

Teaching (Spring 2024):

• COMPSCI 334.01, MATHEMATICAL FOUNDATIONS Synopsis

  North Building 311, TuTh 03:05 PM-04:20 PM

• MATH 487.01, INTRO TO MATHEMATICAL LOGIC Synopsis

  Physics 205, TuTh 03:05 PM-04:20 PM

  (also cross-listed as COMPSCI 487.01)

Office Hours:

Please email me for office hours.

Education:

Ph.D.

Massachusetts Institute of Technology

2010

Recent Publications

1. He, W; Rossman, B, Symmetric Formulas for Products of Permutations, Leibniz International Proceedings in Informatics, LIPIcs, vol. 251 (January, 2023), ISBN 9783959772631 [doi]  [abs]
2. Kush, D; Rossman, B, TREE-DEPTH AND THE FORMULA COMPLEXITY OF SUBGRAPH ISOMORPHISM, SIAM Journal on Computing, vol. 52 no. 1 (January, 2023), pp. 273-325 [doi]  [abs]
3. Cavalar, BP; Kumar, M; Rossman, B, Monotone Circuit Lower Bounds from Robust Sunflowers., Algorithmica, vol. 84 no. 12 (January, 2022), pp. 3655-3685 [doi]  [abs]
4. Rossman, B, Shrinkage of decision lists and DNF formulas, Leibniz International Proceedings in Informatics, LIPIcs, vol. 185 (February, 2021), ISBN 9783959771771 [doi]  [abs]
5. Kawarabayashi, KI; Rossman, B, A polynomial excluded-minor approximation of treedepth, Journal of the European Mathematical Society, vol. 24 no. 4 (January, 2021), pp. 1449-1470 [doi]  [abs]

Recent Grant Support

• NSF Student Travel Grant for 2023 Conference on Computational Complexity, National Science Foundation, 2023/06-2024/05.