| Tree-depth and the formula complexity of subgraph isomorphism D Kush, B Rossman SIAM Journal on Computing 52 (1), 273-325, 2023 | 10 | 2023 |
| Improved low-depth set-multilinear circuit lower bounds D Kush, S Saraf arXiv preprint arXiv:2205.00611, 2022 | 8 | 2022 |
| Near-optimal set-multilinear formula lower bounds D Kush, S Saraf 38th Computational Complexity Conference (CCC 2023), 2023 | 6 | 2023 |
| A# sat algorithm for small constant-depth circuits with PTF gates S Bajpai, V Krishan, D Kush, N Limaye, S Srinivasan Algorithmica 84 (4), 1132-1162, 2022 | 6 | 2022 |
| Near neighbor search via efficient average distortion embeddings D Kush, A Nikolov, H Tang arXiv preprint arXiv:2105.04712, 2021 | 2 | 2021 |
| Exponential Lower Bounds for Sums of ROABPs P Chatterjee, D Kush, S Saraf, A Shpilka arXiv preprint arXiv:2312.15874, 2023 | 1 | 2023 |
| Lower Bounds for Set-Multilinear Branching Programs P Chatterjee, D Kush, S Saraf, A Shpilka 39th Computational Complexity Conference (CCC 2024), 2024 | | 2024 |
| The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs N Balachandran, D Kush arXiv preprint arXiv:1908.02628, 2019 | | 2019 |
| 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) S Agrawal, M Shadravan, C Stein, D Aharonov, L Zhou, A Andoni, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |
| Deconstructing Arsovski’s proof of Snevily’s conjecture D Kush, IMS Student Resonance, 879, 2017 | | 2017 |
| Orthogonal Vectors and Related Problems D Kush | | |
| A Faster Algorithm for 0-1 Integer Programming from Communication Complexity D Kush, S Srinivasan | | |
