Morgan Shirley

According to our database, Morgan Shirley authored at least 8 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

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

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

The Power of Randomness in Communication

Morgan Shirley

PhD thesis, 2024

An Improved Protocol for ExactlyN with More Than 3 Players.

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

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

The Strength of Equality Oracles in Communication.

Toniann Pitassi, Morgan Shirley, Adi Shraibman

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Separation of the Factorization Norm and Randomized Communication Complexity.

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

Proceedings of the 38th Computational Complexity Conference, 2023

2020

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity.

Toniann Pitassi, Morgan Shirley, Thomas Watson

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018

On the Structure of Unconditional UC Hybrid Protocols.

Mike Rosulek, Morgan Shirley

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017

Time-dependent shortest paths in bounded treewidth graphs.

Glencora Borradaile, Morgan Shirley

CoRR, 2017