معرفی
Morgan Shirley is a postdoctoral researcher in theoretical computer science at the University of Victoria, hosted by Professors Sajin Koroth and Bruce Kapron. Previously, he completed his PhD at the University of Toronto under the supervision of Toni Pitassi and a Masters degree at Oregon State University advised by Mike Rosulek.
His educational background includes:
- PhD in Computer Science, University of Toronto
- Masters in Computer Science, Oregon State University
Shirley's research focuses on computational complexity, with particular emphasis on communication complexity, proof complexity, and the interplay between theoretical computer science and additive combinatorics. His work often involves proving lower bounds and developing new techniques in matrix analysis and Boolean function theory, driven by fundamental questions about computational limits.
His publications from 2018 to 2025 reveal a consistent trajectory in communication complexity, featuring breakthroughs in factorization norms, equality oracles, and multi-party protocols. A unifying thread is the application of combinatorial and algebraic methods—particularly matrix analysis—to establish tight lower bounds and structural insights across diverse computational models.
No scientific awards were mentioned in the provided text.
There is no information available regarding student advising or research grants, reflecting his current postdoctoral status focused on independent research rather than mentorship or funded projects.
