Sepehr Assadi

Sepehr Assadi is an Associate Professor and Faculty of Mathematics Research Chair at the Cheriton School of Computer Science, University of Waterloo, since 2023. His research focuses on theoretical computer science, particularly algorithm design and complexity theory for modern computation models like streaming, distributed, and sublinear time algorithms.

• Recognized with the 2025 Presburger Award for groundbreaking work in multi-pass streaming lower bounds
• Developed hierarchical embedding technique for optimal lower bounds in graph streaming
• Key contributions to maximal independent set, maximum matching, and minimum spanning tree problems

His work has been cited over 2,500 times (h-index: 30). He has served on program committees for major conferences (FOCS, STOC, COLT) and mentors students in graph algorithms and complexity theory. Awards include Sloan Research Fellowship, NSERC Discovery Grant, and Google Research Scholar Award.