| A Theoretical Analysis of Contrastive Unsupervised Representation Learning S Arora, H Khandeparkar, M Khodak, O Plevrakis, N Saunshi arXiv preprint arXiv:1902.09229, 2019 | 428 | 2019 |
| A Theoretical Analysis of Contrastive Unsupervised Representation Learning N Saunshi, O Plevrakis, S Arora, M Khodak, H Khandeparkar International Conference on Machine Learning, 5628-5637, 2019 | 337 | 2019 |
| Separating the communication complexity of truthful and non-truthful combinatorial auctions S Assadi, H Khandeparkar, RR Saxena, SM Weinberg Proceedings of the 52nd Annual ACM SIGACT Symposium on theory of computing …, 2020 | 10 | 2020 |
| A theoretical analysis of contrastive unsupervised representation learning H Khandeparkar | 3 | 2019 |
| Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions S Assadi, H Khandeparkar, RR Saxena, SM Weinberg SIAM Journal on Computing 51 (3), STOC20-75-STOC20-114, 2021 | 2 | 2021 |
| Subgraph Counts and The Planted Clique Problem M Bahrani, H Khandeparkar | | 2017 |
