Vertices of Degree k in Random Unlabeled Trees. - Konstantinos Panagiotou; Makrand Sinha (Electron. Notes Discret. Math., 2009)

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. - Thomas Holenstein; Makrand Sinha (FOCS, 2012)

Vertices of degree k in random unlabeled trees. - Konstantinos Panagiotou; Makrand Sinha (J. Graph Theory, 2012)

Fooling Pairs in Randomized Communication Complexity. - Shay Moran; Makrand Sinha; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

On the communication complexity of greater-than. - Sivaramakrishnan Natarajan Ramamoorthy; Makrand Sinha (Allerton, 2015)

On Parallelizing Streaming Algorithms. - Anup Rao 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2015)

Simplified Separation of Information and Communication. - Anup Rao 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2015)

A Direct-Sum Theorem for Read-Once Branching Programs. - Anup Rao 001; Makrand Sinha (APPROX-RANDOM, 2016)

Lower Bounds for Approximating the Matching Polytope. - Makrand Sinha (Electron. Colloquium Comput. Complex., 2017)

Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. - Makrand Sinha; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2018)

Lower Bounds for Interactive Compression and Linear Programs. - Makrand Sinha (2018)

Online vector balancing and geometric discrepancy. - Nikhil Bansal 001; Haotian Jiang; Sahil Singla 001; Makrand Sinha (STOC, 2020)

$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. - Nikhil Bansal 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2020)

Edge Estimation with Independent Set Oracles. - Paul Beame; Sariel Har-Peled; Sivaramakrishnan Natarajan Ramamoorthy; Cyrus Rashtchian; Makrand Sinha (ACM Trans. Algorithms, 2020)

Majorizing Measures for the Optimizer. - Sander Borst; Daniel Dadush; Neil Olver; Makrand Sinha (ITCS, 2021)

Online Discrepancy Minimization for Stochastic Arrivals. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (SODA, 2021)

Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. - Nikhil Bansal 001; Makrand Sinha; Ronald de Wolf (CCC, 2022)

Smoothed Analysis of the Komlós Conjecture. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ICALP, 2022)

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ITCS, 2022)

Quantum-Classical Tradeoffs in the Random Oracle Model. - Yassine Hamoudi; Qipeng Liu 001; Makrand Sinha (CoRR, 2022)

Fourier Growth of Communication Protocols for XOR Functions. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (FOCS, 2023)

Quantum Cryptography in Algorithmica. - William Kretschmer; Luowen Qian; Makrand Sinha; Avishay Tal (STOC, 2023)

Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries. - Tony Metger; Alexander Poremba; Makrand Sinha; Henry Yuen (FOCS, 2024)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. - Jamico Schade; Makrand Sinha; Stefan Weltge (IPCO, 2024)

The Power of Adaptivity in Quantum Query Algorithms. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (STOC, 2024)

The NISQ Complexity of Collision Finding. - Yassine Hamoudi; Qipeng Liu 001; Makrand Sinha (IACR Cryptol. ePrint Arch., 2024)

Pseudorandom unitaries with non-adaptive security. - Tony Metger; Alexander Poremba; Makrand Sinha; Henry Yuen (IACR Cryptol. ePrint Arch., 2024)

The Hardness of Learning Quantum Circuits and its Cryptographic Applications. - Bill Fefferman; Soumik Ghosh; Makrand Sinha; Henry Yuen (IACR Cryptol. ePrint Arch., 2025)