default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMakrand Sinha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Yassine Hamoudi
, Qipeng Liu, Makrand Sinha:
The NISQ Complexity of Collision Finding. EUROCRYPT (4) 2024: 3-32- [c18]Jamico Schade, Makrand Sinha, Stefan Weltge:
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. IPCO 2024: 379-392 - [c17]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. STOC 2024: 1488-1497 - [i26]Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen:
Pseudorandom unitaries with non-adaptive security. CoRR abs/2402.14803 (2024) - [i25]Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen:
Simple constructions of linear-depth t-designs and pseudorandom unitaries. CoRR abs/2404.12647 (2024) - [i24]Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen:
Pseudorandom unitaries with non-adaptive security. IACR Cryptol. ePrint Arch. 2024: 302 (2024) - [i23]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
The NISQ Complexity of Collision Finding. IACR Cryptol. ePrint Arch. 2024: 360 (2024) - 2023
- [c16]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. FOCS 2023: 721-732 - [c15]William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. STOC 2023: 1589-1602 - [i22]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. CoRR abs/2307.13926 (2023) - [i21]Jamico Schade, Makrand Sinha, Stefan Weltge:
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. CoRR abs/2308.16711 (2023) - [i20]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. CoRR abs/2311.16057 (2023) - 2022
- [c14]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. CCC 2022: 28:1-28:21 - [c13]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. ICALP 2022: 14:1-14:12 - [c12]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS 2022: 13:1-13:22 - [i19]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms. CoRR abs/2203.00212 (2022) - [i18]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. CoRR abs/2204.11427 (2022) - [i17]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
Quantum-Classical Tradeoffs in the Random Oracle Model. CoRR abs/2211.12954 (2022) - [i16]William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. CoRR abs/2212.00879 (2022) - 2021
- [c11]Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha:
Majorizing Measures for the Optimizer. ITCS 2021: 73:1-73:20 - [c10]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. SODA 2021: 2842-2861 - [c9]Nikhil Bansal, Makrand Sinha:
k-forrelation optimally separates Quantum and classical query complexity. STOC 2021: 1303-1316 - [i15]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. CoRR abs/2111.07049 (2021) - 2020
- [j4]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms 16(4): 52:1-52:27 (2020) - [c8]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online vector balancing and geometric discrepancy. STOC 2020: 1139-1152 - [i14]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. CoRR abs/2007.10622 (2020) - [i13]Nikhil Bansal, Makrand Sinha:
k-Forrelation Optimally Separates Quantum and Classical Query Complexity. CoRR abs/2008.07003 (2020) - [i12]Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha:
Majorizing Measures for the Optimizer. CoRR abs/2012.13306 (2020) - [i11]Nikhil Bansal, Makrand Sinha:
$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c7]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. FOCS 2019: 966-981 - [i10]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online Vector Balancing and Geometric Discrepancy. CoRR abs/1912.03350 (2019) - 2018
- [b1]Makrand Sinha:
Lower Bounds for Interactive Compression and Linear Programs. University of Washington, USA, 2018 - [j3]Anup Rao, Makrand Sinha:
Simplified Separation of Information and Communication. Theory Comput. 14(1): 1-29 (2018) - [c6]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ITCS 2018: 38:1-38:21 - [c5]Makrand Sinha:
Lower Bounds for Approximating the Matching Polytope. SODA 2018: 1585-1604 - [i9]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. CoRR abs/1811.10090 (2018) - [i8]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i7]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. CoRR abs/1711.07567 (2017) - [i6]Makrand Sinha:
Lower Bounds for Approximating the Matching Polytope. CoRR abs/1711.10145 (2017) - [i5]Makrand Sinha:
Lower Bounds for Approximating the Matching Polytope. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Anup Rao, Makrand Sinha:
A Direct-Sum Theorem for Read-Once Branching Programs. APPROX-RANDOM 2016: 44:1-44:15 - [c3]Shay Moran, Makrand Sinha, Amir Yehudayoff:
Fooling Pairs in Randomized Communication Complexity. SIROCCO 2016: 49-59 - 2015
- [c2]Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha:
On the communication complexity of greater-than. Allerton 2015: 442-444 - [i4]Anup Rao, Makrand Sinha:
On Parallelizing Streaming Algorithms. Electron. Colloquium Comput. Complex. TR15 (2015) - [i3]Anup Rao, Makrand Sinha:
Simplified Separation of Information and Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i2]Shay Moran, Makrand Sinha, Amir Yehudayoff:
Fooling Pairs in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [j2]Konstantinos Panagiotou, Makrand Sinha:
Vertices of degree k in random unlabeled trees. J. Graph Theory 69(2): 114-130 (2012) - [c1]Thomas Holenstein, Makrand Sinha:
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. FOCS 2012: 698-707 - [i1]Thomas Holenstein, Makrand Sinha:
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. CoRR abs/1205.4576 (2012)
2000 – 2009
- 2009
- [j1]Konstantinos Panagiotou, Makrand Sinha:
Vertices of Degree k in Random Unlabeled Trees. Electron. Notes Discret. Math. 34: 41-45 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
