Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. - André Chailloux; Iordanis Kerenidis; Srijita Kundu; Jamie Sikora (TQC, 2014)

A Composition Theorem for Randomized Query complexity. - Anurag Anshu; Dmitry Gavinsky; Rahul Jain 001; Srijita Kundu; Troy Lee; Priyanka Mukhopadhyay; Miklos Santha; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2017)

Lifting randomized query complexity to randomized communication complexity. - Anurag Anshu; Naresh B. Goud; Rahul Jain 001; Srijita Kundu; Priyanka Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Quadratically Tight Relations for Randomized Query Complexity. - Dmitry Gavinsky; Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Electron. Colloquium Comput. Complex., 2017)

Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. - Sourav Chakraborty 001; Sushrut Karmalkar; Srijita Kundu; Satyanarayana V. Lokam; Nitin Saurabh (LATIN, 2018)

A Direct Product Theorem for One-Way Quantum Communication. - Rahul Jain 001; Srijita Kundu (Electron. Colloquium Comput. Complex., 2020)

Quadratically Tight Relations for Randomized Query Complexity. - Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Theory Comput. Syst., 2020)

On Query-To-Communication Lifting for Adversary Bounds. - Anurag Anshu; Shalev Ben-David; Srijita Kundu (CCC, 2021)

A direct product theorem for quantum communication complexity with applications to device-independent QKD. - Rahul Jain 001; Srijita Kundu (Electron. Colloquium Comput. Complex., 2021)

Diagonal distance of quantum codes and hardness of the minimum distance problem. - Upendra Kapshikar; Srijita Kundu (CoRR, 2022)

A device-independent protocol for XOR oblivious transfer. - Srijita Kundu; Jamie Sikora; Ernest Y.-Z. Tan (Quantum, 2022)

Rhythmus periodic frequent pattern mining without periodicity threshold. - Subrata Datta; Kalyani Mali; Sourav Das; Srijita Kundu; Sayanta Harh (J. Ambient Intell. Humaniz. Comput., 2023)

Composably secure device-independent encryption with certified deletion. - Srijita Kundu; Ernest Y.-Z. Tan (Quantum, 2023)

On the Hardness of the Minimum Distance Problem of Quantum Codes. - Upendra Kapshikar; Srijita Kundu (IEEE Trans. Inf. Theory, 2023)

Oracle Separation of QMA and QCMA with Bounded Adaptivity. - Shalev Ben-David; Srijita Kundu (ICALP, 2024)

On the Power of Quantum Distributed Proofs. - Atsuya Hasegawa; Srijita Kundu; Harumichi Nishimura (PODC, 2024)

Separations in query complexity for total search problems. - Shalev Ben-David; Srijita Kundu (CoRR, 2024)

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

Device-independent uncloneable encryption. - Srijita Kundu; Ernest Y.-Z. Tan (Quantum, 2025)

Does there exist a quantum fingerprinting protocol without coherent measurements? - Atsuya Hasegawa; Srijita Kundu; François Le Gall; Harumichi Nishimura; Qisheng Wang (CoRR, 2025)

A Cautionary Note on Quantum Oracles. - Avantika Agarwal; Srijita Kundu (CoRR, 2025)