Supartha Podder

According to our database, Supartha Podder authored at least 15 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Quantum Computation with Correlated Measurements: Implications for the Complexity Landscape.

David Miloschewsky, Supartha Podder

CoRR, July, 2025

On the Fine-Grained Query Complexity of Symmetric Functions.

Supartha Podder, Penghui Yao, Zekun Ye

Comput. Complex., June, 2025

Uncloneable Quantum States Are Necessary as Proofs and Advice.

Rohit Chatterjee, Srijita Kundu, Supartha Podder

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

New Lower-Bounds for Quantum Computation with Non-Collapsing Measurements.

David Miloschewsky, Supartha Podder

Proceedings of the 40th Computational Complexity Conference, 2025

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

Revisiting BQP with Non-Collapsing Measurements.

David Miloschewsky, Supartha Podder

CoRR, 2024

The Role of piracy in quantum proofs.

Anne Broadbent, Alex B. Grilo, Supartha Podder, Jamie Sikora

CoRR, 2024

2022

Decision Tree Complexity versus Block Sensitivity and Degree.

Rahul Chugh, Supartha Podder, Swagato Sanyal

Electron. Colloquium Comput. Complex., 2022

2021

Secure Software Leasing Without Assumptions.

Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Communication Memento: Memoryless Communication Complexity.

Srinivasan Arunachalam, Supartha Podder

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

How symmetric is too symmetric for large quantum speedups?

Shalev Ben-David, Supartha Podder

CoRR, 2020

2016

Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.

Raghav Kulkarni, Supartha Podder

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry.

Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014

Two Results about Quantum Messages.

Hartmut Klauck, Supartha Podder

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

New Bounds for the Garden-Hose Model.

Hartmut Klauck, Supartha Podder

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014