| The strength of equality oracles in communication T Pitassi, M Shirley, A Shraibman 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023 | 6 | 2023 |
| Separation of the factorization norm and randomized communication complexity TM Cheung, H Hatami, K Hosseini, M Shirley 38th Computational Complexity Conference (CCC 2023), 2023 | 4 | 2023 |
| Nondeterministic and randomized boolean hierarchies in communication complexity T Pitassi, M Shirley, T Watson computational complexity 30, 1-48, 2021 | 4 | 2021 |
| An improved protocol for ExactlyN with more than 3 players L Hambardzumyan, T Pitassi, S Sherif, M Shirley, A Shraibman arXiv preprint arXiv:2309.06554, 2023 | 1 | 2023 |
| On the structure of unconditional UC hybrid protocols M Rosulek, M Shirley Theory of Cryptography Conference, 98-126, 2018 | 1 | 2018 |
| Time-dependent shortest paths in bounded treewidth graphs G Borradaile, M Shirley arXiv preprint arXiv:1706.01508, 2017 | 1 | 2017 |
| The General Adversary Bound: A Survey L Li, M Shirley arXiv preprint arXiv:2104.06380, 2021 | | 2021 |
| On the Structure of Unconditional UC Hybrid Protocols M Shirley | | 2017 |
| Time-dependent shortest paths in treelike graphs M Shirley | | 2016 |
