New Bounds for the Garden-Hose Model. - Hartmut Klauck; Supartha Podder (FSTTCS, 2014)

Two Results about Quantum Messages. - Hartmut Klauck; Supartha Podder (MFCS (2), 2014)

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. - Nikhil Balaji; Samir Datta; Raghav Kulkarni; Supartha Podder (MFCS, 2016)

Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. - Raghav Kulkarni; Supartha Podder (STACS, 2016)

How symmetric is too symmetric for large quantum speedups? - Shalev Ben-David; Supartha Podder (CoRR, 2020)

Communication Memento: Memoryless Communication Complexity. - Srinivasan Arunachalam; Supartha Podder (ITCS, 2021)

Secure Software Leasing Without Assumptions. - Anne Broadbent; Stacey Jeffery; Sébastien Lord; Supartha Podder; Aarthi Sundaram (TCC (1), 2021)

Decision Tree Complexity versus Block Sensitivity and Degree. - Rahul Chugh; Supartha Podder; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2022)

The Role of piracy in quantum proofs. - Anne Broadbent; Alex B. Grilo; Supartha Podder; Jamie Sikora (CoRR, 2024)

Revisiting BQP with Non-Collapsing Measurements. - David Miloschewsky; Supartha Podder (CoRR, 2024)

Symmetries, Graph Properties, and Quantum Speedups. - Shalev Ben-David; Andrew M. Childs; András Gilyén; William Kretschmer; Supartha Podder; Daochen Wang (SIAM J. Comput., 2024)

New Lower-Bounds for Quantum Computation with Non-Collapsing Measurements. - David Miloschewsky; Supartha Podder (CCC, 2025)

Uncloneable Quantum States Are Necessary as Proofs and Advice. - Rohit Chatterjee; Srijita Kundu; Supartha Podder (STOC, 2025)

On the Fine-Grained Query Complexity of Symmetric Functions. - Supartha Podder; Penghui Yao; Zekun Ye (Comput. Complex., 2025)

Quantum Computation with Correlated Measurements: Implications for the Complexity Landscape. - David Miloschewsky; Supartha Podder (CoRR, 2025)