| 2024 | EuroCrypt | The NISQ Complexity of Collision Finding. | Yassine Hamoudi, Qipeng Liu, Makrand Sinha |
| 2024 | FOCS | Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries. | Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen |
| 2024 | IPCO | Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. | Jamico Schade, Makrand Sinha, Stefan Weltge |
| 2024 | STOC | The Power of Adaptivity in Quantum Query Algorithms. | Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu |
| 2023 | FOCS | Fourier Growth of Communication Protocols for XOR Functions. | Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu |
| 2023 | STOC | Quantum Cryptography in Algorithmica. | William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal |
| 2022 | ICALP | Smoothed Analysis of the Komls Conjecture. | Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha |
| 2021 | SODA | Online Discrepancy Minimization for Stochastic Arrivals. | Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha |
| 2021 | STOC | k-forrelation optimally separates Quantum and classical query complexity. | Nikhil Bansal, Makrand Sinha |
| 2020 | STOC | Online vector balancing and geometric discrepancy. | Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha |
| 2019 | FOCS | Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. | Makrand Sinha, Ronald de Wolf |
| 2018 | SODA | Lower Bounds for Approximating the Matching Polytope. | Makrand Sinha |
| 2016 | SIROCCO | Fooling Pairs in Randomized Communication Complexity. | Shay Moran, Makrand Sinha, Amir Yehudayoff |
| 2012 | FOCS | Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. | Thomas Holenstein, Makrand Sinha |