Sepehr Assadi

Assistant Professor
Department of Computer Science, Rutgers University

Email: firstname (at) lastname (dot) info
Office: CoRE 310
Phone: (848) 445 7289

I am an assistant professor in the Computer Science Department at Rutgers University and part of the Theory of Computing Group. Prior to that, I spent a wonderful year as a postdoctoral researcher at Princeton University supported by the Simons Algorithms and Geometry Collaboration. I received my PhD from the department of Computer & Information Science at University of Pennsylvania and was extremely fortunate to have Sanjeev Khanna as my advisor. I got my B.Sc. in Computer Engineering from Sharif University of Technology.

My research has been generously supported by the Alfred P. Sloan Foundation (Sloan Research Fellowship), the National Science Foundation (NSF) (Faculty Early Career Development (CAREER) Award: CCF-2047061), Google Research (Research Scholar Program), and Rutgers Research Council (Fulcrum Award).

Research Interests: My primary research interest is in theoretical foundations of big data analysis. This in particular includes sublinear algorithms and lower bounds in various models of computation for processing massive datasets such as streaming, distributed communication, massively parallel computation, and sublinear time algorithms. More broadly, I am also interested in algorithmic graph theory, communication complexity, online algorithms, and algorithmic game theory.

Personal: My better half, Mina Tahmasbi Arashloo, works on networking at University of Waterloo.

Prospective Students: I am not admitting graduate students during the academic year 2022/2023 (and will not be able to respond individually to applicants emails). If you are interested in the theory group at Rutgers, consider applying to our PhD Program.


Professional Activities


I am very fortunate to be working/have worked with the following amazing students and postdocs:


Click on each title for a summary of the paper, drafts, presentation slides, videos, etc. For further details, see [DBLP] and [Google Scholar].