| Proofs of useful work M Ball, A Rosen, M Sabin, PN Vasudevan Cryptology ePrint Archive, 2017 | 165 | 2017 |
| Average-case fine-grained hardness M Ball, A Rosen, M Sabin, PN Vasudevan Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 80 | 2017 |
| Proofs of work from worst-case assumptions M Ball, A Rosen, M Sabin, PN Vasudevan Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 68 | 2018 |
| Identity-based encryption with eth residuosity and its incompressibility D Boneh, R LaVigne, M Sabin Autumn 2013 TRUST Conference. Washington DC (Oct 9-10, 2013), poster …, 2013 | 13 | 2013 |
| Fine-grained derandomization: from problem-centric to resource-centric complexity ML Carmosino, R Impagliazzo, M Sabin 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 11 | 2018 |
| XOR codes and sparse learning parity with noise A Bogdanov, M Sabin, PN Vasudevan Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 8 | 2019 |
| Learning with distributional inverters E Binnendyk, M Carmosino, A Kolokolova, R Ramyaa, M Sabin International Conference on Algorithmic Learning Theory, 90-106, 2022 | 5 | 2022 |
| Manifesting the sociotechnical: experimenting with methods for social context and social justice E Goss, L Hu, M Sabin, S Teeple Proceedings of the 2020 Conference on Fairness, Accountability, and …, 2020 | 3 | 2020 |
| On The Utility of Fine-Grained Complexity Theory M Sabin UC Berkeley, 2020 | | 2020 |
| XOR Codes and Sparse Random Linear Equations with Noise. A Bogdanov, M Sabin, PN Vasudevan Electron. Colloquium Comput. Complex., 2018 | | 2018 |
