Makrand Sinha - RankMe

54 papers A* 11A 5B 2Journal 32Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	The Hardness of Learning Quantum Circuits and Its Cryptographic Applications. ITCS Bill Fefferman, Soumik Ghosh, Makrand Sinha, Henry Yuen
2025	J	`jnl`	The Hardness of Learning Quantum Circuits and its Cryptographic Applications. CoRR Bill Fefferman, Soumik Ghosh, Makrand Sinha, Henry Yuen
2025	J	`jnl`	The Hardness of Learning Quantum Circuits and its Cryptographic Applications. IACR Cryptol. ePrint Arch. Bill Fefferman, Soumik Ghosh, Makrand Sinha, Henry Yuen
2024	B	`conf`	Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. IPCO Jamico Schade, Makrand Sinha, Stefan Weltge
2024	J	`jnl`	Pseudorandom unitaries with non-adaptive security. CoRR Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
2024	J	`jnl`	Pseudorandom unitaries with non-adaptive security. IACR Cryptol. ePrint Arch. Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
2024	A*	`conf`	Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries. FOCS Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
2024	J	`jnl`	Simple constructions of linear-depth t-designs and pseudorandom unitaries. CoRR Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
2024	—	`conf`	The NISQ Complexity of Collision Finding. EUROCRYPT (4) Yassine Hamoudi, Qipeng Liu, Makrand Sinha
2024	J	`jnl`	The NISQ Complexity of Collision Finding. IACR Cryptol. ePrint Arch. Yassine Hamoudi, Qipeng Liu, Makrand Sinha
2024	A*	`conf`	The Power of Adaptivity in Quantum Query Algorithms. STOC Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	A*	`conf`	Fourier Growth of Communication Protocols for XOR Functions. FOCS Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	J	`jnl`	Fourier Growth of Communication Protocols for XOR Functions. CoRR Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	J	`jnl`	Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. CoRR Jamico Schade, Makrand Sinha, Stefan Weltge
2023	A*	`conf`	Quantum Cryptography in Algorithmica. STOC William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
2023	J	`jnl`	The Power of Adaptivity in Quantum Query Algorithms. CoRR Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2022	A	`conf`	Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. CCC Nikhil Bansal, Makrand Sinha, Ronald de Wolf
2022	J	`jnl`	Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms. CoRR Nikhil Bansal, Makrand Sinha, Ronald de Wolf
2022	A	`conf`	Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2022	J	`jnl`	Quantum Cryptography in Algorithmica. CoRR William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
2022	J	`jnl`	Quantum-Classical Tradeoffs in the Random Oracle Model. CoRR Yassine Hamoudi, Qipeng Liu, Makrand Sinha
2022	A*	`conf`	Smoothed Analysis of the Komlós Conjecture. ICALP Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2022	J	`jnl`	Smoothed Analysis of the Komlós Conjecture. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	A	`conf`	Majorizing Measures for the Optimizer. ITCS Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2021	A*	`conf`	Online Discrepancy Minimization for Stochastic Arrivals. SODA Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	J	`jnl`	Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	A*	`conf`	k-forrelation optimally separates Quantum and classical query complexity. STOC Nikhil Bansal, Makrand Sinha
2020	J	`jnl`	$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. Electron. Colloquium Comput. Complex. Nikhil Bansal, Makrand Sinha
2020	J	`jnl`	Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2020	J	`jnl`	Majorizing Measures for the Optimizer. CoRR Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2020	J	`jnl`	Online Discrepancy Minimization for Stochastic Arrivals. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2020	A*	`conf`	Online vector balancing and geometric discrepancy. STOC Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha
2020	J	`jnl`	k-Forrelation Optimally Separates Quantum and Classical Query Complexity. CoRR Nikhil Bansal, Makrand Sinha
2019	A*	`conf`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. FOCS Makrand Sinha, Ronald de Wolf
2019	J	`jnl`	Online Vector Balancing and Geometric Discrepancy. CoRR Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha
2018	A	`conf`	Edge Estimation with Independent Set Oracles. ITCS Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2018	J	`jnl`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. CoRR Makrand Sinha, Ronald de Wolf
2018	J	`jnl`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. Electron. Colloquium Comput. Complex. Makrand Sinha, Ronald de Wolf
2018	A*	`conf`	Lower Bounds for Approximating the Matching Polytope. SODA Makrand Sinha
2018	—	`—`	Lower Bounds for Interactive Compression and Linear Programs. Makrand Sinha
2018	J	`jnl`	Simplified Separation of Information and Communication. Theory Comput. Anup Rao, Makrand Sinha
2017	J	`jnl`	Edge Estimation with Independent Set Oracles. CoRR Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2017	J	`jnl`	Lower Bounds for Approximating the Matching Polytope. CoRR Makrand Sinha
2017	J	`jnl`	Lower Bounds for Approximating the Matching Polytope. Electron. Colloquium Comput. Complex. Makrand Sinha
2016	—	`conf`	A Direct-Sum Theorem for Read-Once Branching Programs. APPROX-RANDOM Anup Rao, Makrand Sinha
2016	B	`conf`	Fooling Pairs in Randomized Communication Complexity. SIROCCO Shay Moran, Makrand Sinha, Amir Yehudayoff
2015	J	`jnl`	On Parallelizing Streaming Algorithms. Electron. Colloquium Comput. Complex. Anup Rao, Makrand Sinha
2015	—	`conf`	On the communication complexity of greater-than. Allerton Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha
2015	J	`jnl`	Simplified Separation of Information and Communication. Electron. Colloquium Comput. Complex. Anup Rao, Makrand Sinha
2014	J	`jnl`	Fooling Pairs in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. Shay Moran, Makrand Sinha, Amir Yehudayoff
2012	J	`jnl`	Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls CoRR Thomas Holenstein, Makrand Sinha
2012	A*	`conf`	Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. FOCS Thomas Holenstein, Makrand Sinha
2012	J	`jnl`	Vertices of degree J. Graph Theory Konstantinos Panagiotou, Makrand Sinha
2009	J	`jnl`	Vertices of Degree k in Random Unlabeled Trees. Electron. Notes Discret. Math. Konstantinos Panagiotou, Makrand Sinha