Benjamin Rossman, Associate Professor of Computer Science

Contact Info:

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

Teaching (Fall 2023):

• COMPSCI 590.02, ADVANCED TOPICS IN CPS Synopsis

  Bio Sci 113, MW 03:05 PM-04:20 PM

  (also cross-listed as MATH 590-02.02)

• COMPSCI 590.03, ADVANCED TOPICS IN CPS Synopsis

  Bio Sci 113, MW 03:05 PM-04:20 PM

  (also cross-listed as MATH 590-02.03)

• COMPSCI 590.04, ADVANCED TOPICS IN CPS Synopsis

  Bio Sci 113, MW 03:05 PM-04:20 PM

  (also cross-listed as MATH 590-02.04)

Office Hours:

Please email me for office hours.

Education:

Ph.D.

Massachusetts Institute of Technology

2010

Recent Publications   (More 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.      
• Rossman Alfred P. Sloan Foundation Fellowship (transfer), Alfred P. Sloan Foundation, 2020/01-2021/09.