| Optimal bounds for parity-oblivious random access codes A Chailloux, I Kerenidis, S Kundu, J Sikora New Journal of Physics 18 (4), 045003, 2016 | 65 | 2016 |
| A device-independent protocol for XOR oblivious transfer S Kundu, J Sikora, EYZ Tan Quantum 6, 725, 2022 | 16 | 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 | 12 | 2017 |
| 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 | 9 | 2022 |
| On query-to-communication lifting for adversary bounds A Anshu, S Ben-David, S Kundu arXiv preprint arXiv:2012.03415, 2020 | 8 | 2020 |
| Composably secure device-independent encryption with certified deletion S Kundu, EYZ Tan arXiv preprint arXiv:2011.12704, 2020 | 5 | 2020 |
| A direct product theorem for one-way quantum communication R Jain, S Kundu arXiv preprint arXiv:2008.08963, 2020 | 4 | 2020 |
| 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 | 4* | 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 | 4 | 2018 |
| Device-independent uncloneable encryption S Kundu, EYZ Tan arXiv preprint arXiv:2210.01058, 2022 | 2 | 2022 |
| Diagonal distance of quantum codes and hardness of the minimum distance problem U Kapshikar, S Kundu arXiv preprint arXiv:2203.04262, 2022 | 1 | 2022 |
Jamie SikoraVirginia TechVerified email at vt.edu
