Time-dependent shortest paths in bounded treewidth graphs. - Glencora Borradaile; Morgan Shirley (CoRR, 2017)

On the Structure of Unconditional UC Hybrid Protocols. - Mike Rosulek; Morgan Shirley (IACR Cryptol. ePrint Arch., 2017)

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. - Toniann Pitassi; Morgan Shirley; Thomas Watson 001 (Comput. Complex., 2021)

Separation of the factorization norm and randomized communication complexity. - TsunMing Cheung; Hamed Hatami; Kaave Hosseini; Morgan Shirley (Electron. Colloquium Comput. Complex., 2022)

The Strength of Equality Oracles in Communication. - Toniann Pitassi; Morgan Shirley; Adi Shraibman (Electron. Colloquium Comput. Complex., 2022)

An improved protocol for ExactlyN with more than 3 players. - Lianna Hambardzumyan; Toniann Pitassi; Suhail Sherif; Morgan Shirley; Adi Shraibman (Electron. Colloquium Comput. Complex., 2023)

A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. - Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan Shirley (Electron. Colloquium Comput. Complex., 2024)

The Power of Randomness in Communication - Morgan Shirley (2024)