| Optimal bounds for parity-oblivious random access codes A Chailloux, I Kerenidis, S Kundu, J Sikora New Journal of Physics 18 (4), 045003, 2016 | 88 | 2016 |
| A device-independent protocol for XOR oblivious transfer S Kundu, J Sikora, EYZ Tan Quantum 6, 725, 2022 | 28 | 2022 |
| A direct product theorem for quantum communication complexity with applications to device-independent QKD R Jain, S Kundu 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 20 | 2022 |
| A composition theorem for randomized query complexity A Anshu, D Gavinsky, R Jain, S Kundu, T Lee, P Mukhopadhyay, ... arXiv preprint arXiv:1706.00335, 2017 | 17 | 2017 |
| On the hardness of the minimum distance problem of quantum codes U Kapshikar, S Kundu IEEE Transactions on Information Theory 69 (10), 6293-6302, 2023 | 13* | 2023 |
| On query-to-communication lifting for adversary bounds A Anshu, S Ben-David, S Kundu arXiv preprint arXiv:2012.03415, 2020 | 13 | 2020 |
| Device-independent uncloneable encryption S Kundu, EYZ Tan Quantum 9, 1582, 2025 | 8 | 2025 |
| Composably secure device-independent encryption with certified deletion S Kundu, EYZ Tan arXiv preprint arXiv:2011.12704, 2020 | 7 | 2020 |
| A direct product theorem for one-way quantum communication R Jain, S Kundu arXiv preprint arXiv:2008.08963, 2020 | 7 | 2020 |
| Oracle separation of QMA and QCMA with bounded adaptivity S Ben-David, S Kundu arXiv preprint arXiv:2402.00298, 2024 | 6 | 2024 |
| Quadratically tight relations for randomized query complexity R Jain, H Klauck, S Kundu, T Lee, M Santha, S Sanyal, J Vihrovs Theory of Computing Systems 64 (1), 101-119, 2020 | 6* | 2020 |
| Fourier entropy-influence conjecture for random linear threshold functions S Chakraborty, S Karmalkar, S Kundu, SV Lokam, N Saurabh LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 5 | 2018 |
| On the power of quantum distributed proofs A Hasegawa, S Kundu, H Nishimura Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024 | 2 | 2024 |
| Separations in query complexity for total search problems S Ben-David, S Kundu arXiv preprint arXiv:2410.16245, 2024 | 1 | 2024 |
| One-way quantum communication complexity with inner product gadget S Kundu Electron. Colloquium Comput. Complex 24, 152, 2017 | 1 | 2017 |
| Does there exist a quantum fingerprinting protocol without coherent measurements? A Hasegawa, S Kundu, FL Gall, H Nishimura, Q Wang arXiv preprint arXiv:2502.13427, 2025 | | 2025 |
| Are uncloneable proof and advice states strictly necessary? R Chatterjee, S Kundu, S Podder arXiv preprint arXiv:2410.11827, 2024 | | 2024 |
Jamie SikoraVirginia TechVerified email at vt.edu
