Sepehr Assadi
Scholar

Sepehr Assadi

Google Scholar ID: QSVAzVIAAAAJ
University of Waterloo
Streaming algorithmsSublinear algorithmsCommunication complexityTheoretical computer science
Citations & Impact
All-time
Citations
2,131
 
H-index
28
 
i10-index
59
 
Publications
20
 
Co-authors
83
list available
Resume (English only)
Academic Achievements
  • Organizing the A&C Seminar in Fall 2025; Running a reading group on Space Bounded Computation; Co-chairing SOSA 2026 with Eva Rotenberg.
Research Experience
  • Currently an Associate Professor and Faculty of Mathematics Research Chair in the School of Computer Science at the University of Waterloo, part of the Algorithms & Complexity (A&C) Group. Prior to joining the University of Waterloo in 2023, he was an Assistant Professor at the Computer Science Department at Rutgers University.
Education
  • PhD: 2018, Department of Computer & Information Science, University of Pennsylvania, Advisor: Sanjeev Khanna; Postdoctoral Researcher at the Theory of Computation Group, Department of Computer Science, Princeton University, supported by the Simons Algorithms and Geometry Collaboration.
Background
  • Research Interests: Theoretical computer science, primarily algorithm design and complexity theory for modern models of computation. This includes sublinear algorithms and lower bounds in various models for processing massive datasets, especially massive graphs, such as streaming, distributed, massively parallel, and sublinear time algorithms. Also interested in graph theory, communication complexity, online algorithms, and algorithmic game theory.
Miscellany
  • His partner, Mina Tahmasbi Arashloo, works on Networking at the University of Waterloo.