Morgan Shirley

I am a researcher in the field of theoretical computer science. This fall I will be starting as a postdoc at the University of Victoria, hosted by Sajin Koroth and Bruce Kapron. I received my PhD from the University of Toronto under the supervision of Toni Pitassi. I also have an M.S. degree from Oregon State University, where I was advised by Mike Rosulek. We worked on problems in cryptographic complexity.

From a young age I have been interested in computing. More recently, I have focused my attentions on computational complexity. I am most excited about questions related to communication complexity, proof complexity, and connections between theoretical computer science and additive combinatorics.

Papers

An Improved Protocol for ExactlyN With More Than 3 Players

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, and Adi Shraibman

ITCS 2024. (article) (video by Lianna) (video by Suhail) (preprint)

Separation of the Factorization Norm and Randomized Communication Complexity

Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, and Morgan Shirley

CCC 2023. (article) (preprint)

The Strength of Equality Oracles in Communication

Toniann Pitassi, Morgan Shirley, and Adi Shraibman

ITCS 2023. (article) (video) (slides) (preprint)

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

Toniann Pitassi, Morgan Shirley, and Thomas Watson

ICALP 2020. (article) (video) (slides) (preprint)

Journal version in Computational Complexity. (article)

On the Structure of Unconditional UC Hybrid Protocols

Mike Rosulek and Morgan Shirley

TCC 2018. (article) (slides) (preprint)

Time-Dependent Shortest Paths in Bounded Treewidth Graphs

Glencora Borradaile and Morgan Shirley

Manuscript. (preprint)

Other Writings

The General Adversary Bound: A Survey

Lily Li and Morgan Shirley

Manuscript. (article) (preprint)

Miscellaneous

I played bass guitar for the band ITSAWAR. You can check out the EP we recorded here.