Supartha Podder

27 papers A* 2A 3B 2Journal 15Unranked 5
YearRankTypeTitle / Venue / Authors
2025 A conf
New Lower-Bounds for Quantum Computation with Non-Collapsing Measurements.
CCC
David Miloschewsky, Supartha Podder
2025 J jnl
On the Fine-Grained Query Complexity of Symmetric Functions.
Comput. Complex.
Supartha Podder, Penghui Yao, Zekun Ye
2025 J jnl
Quantum Computation with Correlated Measurements: Implications for the Complexity Landscape.
CoRR
David Miloschewsky, Supartha Podder
2025 — conf
The Role of Piracy in Quantum Proofs.
LATINCRYPT
Anne Broadbent, Alex B. Grilo, Supartha Podder, Jamie Sikora
2025 A* conf
Uncloneable Quantum States Are Necessary as Proofs and Advice.
STOC
Rohit Chatterjee, Srijita Kundu, Supartha Podder
2024 J jnl
Revisiting BQP with Non-Collapsing Measurements.
CoRR
David Miloschewsky, Supartha Podder
2024 J jnl
Symmetries, Graph Properties, and Quantum Speedups.
SIAM J. Comput.
Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
2024 J jnl
The Role of piracy in quantum proofs.
CoRR
Anne Broadbent, Alex B. Grilo, Supartha Podder, Jamie Sikora
2023 — conf
Decision Tree Complexity Versus Block Sensitivity and Degree.
FSTTCS
Rahul Chugh, Supartha Podder, Swagato Sanyal
2023 B conf
On the Fine-Grained Query Complexity of Symmetric Functions.
ISAAC
Supartha Podder, Penghui Yao, Zekun Ye
2023 J jnl
On the Fine-Grained Query Complexity of Symmetric Functions.
CoRR
Supartha Podder, Penghui Yao, Zekun Ye
2022 J jnl
Decision Tree Complexity versus Block Sensitivity and Degree.
CoRR
Rahul Chugh, Supartha Podder, Swagato Sanyal
2022 J jnl
Decision Tree Complexity versus Block Sensitivity and Degree.
Electron. Colloquium Comput. Complex.
Rahul Chugh, Supartha Podder, Swagato Sanyal
2021 A conf
Communication Memento: Memoryless Communication Complexity.
ITCS
Srinivasan Arunachalam, Supartha Podder
2021 — conf
Secure Software Leasing Without Assumptions.
TCC (1)
Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram
2020 J jnl
Communication memento: Memoryless communication complexity.
CoRR
Srinivasan Arunachalam, Supartha Podder
2020 J jnl
How symmetric is too symmetric for large quantum speedups?
CoRR
Shalev Ben-David, Supartha Podder
2020 A* conf
Symmetries, Graph Properties, and Quantum Speedups.
FOCS
Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
2020 J jnl
Symmetries, graph properties, and quantum speedups.
CoRR
Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
2016 B conf
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry.
MFCS
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
2016 A conf
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.
STACS
Raghav Kulkarni, Supartha Podder
2015 J jnl
Graph properties in node-query setting: effect of breaking symmetry.
CoRR
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
2015 J jnl
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.
CoRR
Raghav Kulkarni, Supartha Podder
2014 — conf
New Bounds for the Garden-Hose Model.
FSTTCS
Hartmut Klauck, Supartha Podder
2014 J jnl
New Bounds for the Garden-Hose Model.
CoRR
Hartmut Klauck, Supartha Podder
2014 — conf
Two Results about Quantum Messages.
MFCS (2)
Hartmut Klauck, Supartha Podder
2014 J jnl
Two Results about Quantum Messages.
CoRR
Hartmut Klauck, Supartha Podder