A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. - Swapnam Bajpai; Vaibhav Krishan; Deepanshu Kush; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2018)

Near Neighbor Search via Efficient Average Distortion Embeddings. - Deepanshu Kush; Aleksandar Nikolov; Haohua Tang (SoCG, 2021)

The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. - Niranjan Balachandran; Deepanshu Kush (Electron. J. Comb., 2021)

Improved Low-Depth Set-Multilinear Circuit Lower Bounds. - Deepanshu Kush; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2022)

Exponential Lower Bounds Against Sums of ROABPs. - Prerona Chatterjee; Deepanshu Kush; Shubhangi Saraf; Amir Shpilka (Electron. Colloquium Comput. Complex., 2023)

Near-Optimal Set-Multilinear Formula Lower Bounds. - Deepanshu Kush; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2023)

Tree-Depth and the Formula Complexity of Subgraph Isomorphism. - Deepanshu Kush; Benjamin Rossman (SIAM J. Comput., 2023)

Lower Bounds for Set-Multilinear Branching Programs. - Prerona Chatterjee; Deepanshu Kush; Shubhangi Saraf; Amir Shpilka (CCC, 2024)

Polynomial-Time PIT from (Almost) Necessary Assumptions. - Robert Andrews 003; Deepanshu Kush; Roei Tell (Electron. Colloquium Comput. Complex., 2025)