Deepanshu Kush

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 20

Top Topics

Subgraph Isomorphism

Stochastic Local Search Algorithms

Maximum Common Subgraph

Top Venues

Electron. Colloquium Comput. Complex.

Electron. J. Comb.

Publications

Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka
Lower Bounds for Set-Multilinear Branching Programs. CCC (2024)
Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka
Lower Bounds for Set-Multilinear Branching Programs. CoRR (2023)
Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka
Exponential Lower Bounds Against Sums of ROABPs. Electron. Colloquium Comput. Complex. (2023)
Deepanshu Kush, Shubhangi Saraf
Near-Optimal Set-Multilinear Formula Lower Bounds. Electron. Colloquium Comput. Complex. (2023)
Deepanshu Kush, Shubhangi Saraf
Near-Optimal Set-Multilinear Formula Lower Bounds. CCC (2023)
Deepanshu Kush, Benjamin Rossman
Tree-Depth and the Formula Complexity of Subgraph Isomorphism. SIAM J. Comput. 52 (1) (2023)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica 84 (4) (2022)
Deepanshu Kush, Shubhangi Saraf
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. CCC (2022)
Deepanshu Kush, Shubhangi Saraf
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. Electron. Colloquium Comput. Complex. (2022)
Deepanshu Kush, Shubhangi Saraf
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. CoRR (2022)
Niranjan Balachandran, Deepanshu Kush
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. Electron. J. Comb. 28 (2) (2021)
Deepanshu Kush, Aleksandar Nikolov, Haohua Tang
Near Neighbor Search via Efficient Average Distortion Embeddings. SoCG (2021)
Deepanshu Kush, Aleksandar Nikolov, Haohua Tang
Near Neighbor Search via Efficient Average Distortion Embeddings. CoRR (2021)
Deepanshu Kush, Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism. Electron. Colloquium Comput. Complex. 27 (2020)
Deepanshu Kush, Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism. CoRR (2020)
Deepanshu Kush, Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism. FOCS (2020)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS (2019)
Niranjan Balachandran, Deepanshu Kush
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. CoRR (2019)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. CoRR (2018)
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. 25 (2018)