Srijita Kundu
Title
Cited by
Cited by
Year
Optimal bounds for parity-oblivious random access codes
A Chailloux, I Kerenidis, S Kundu, J Sikora
New Journal of Physics 18 (4), 045003, 2016
482016
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
102017
A device-independent protocol for XOR oblivious transfer
S Kundu, J Sikora, EYZ Tan
arXiv preprint arXiv:2006.06671, 2020
42020
Fourier entropy-influence conjecture for random linear threshold functions
S Chakraborty, S Karmalkar, S Kundu, SV Lokam, N Saurabh
Latin American Symposium on Theoretical Informatics, 275-289, 2018
42018
A Direct Product Theorem for One-Way Quantum Communication
R Jain, S Kundu
arXiv preprint arXiv:2008.08963, 2020
32020
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
2*2020
A direct product theorem for quantum communication complexity with applications to device-independent QKD
R Jain, S Kundu
arXiv preprint arXiv:2106.04299, 2021
12021
Composably secure device-independent encryption with certified deletion
S Kundu, E Tan
arXiv preprint arXiv:2011.12704, 2020
12020
On Query-to-Communication Lifting for Adversary Bounds
A Anshu, S Ben-David, S Kundu
arXiv preprint arXiv:2012.03415, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–9