default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrijita Kundu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Shalev Ben-David, Srijita Kundu:
Oracle Separation of QMA and QCMA with Bounded Adaptivity. ICALP 2024: 21:1-21:18- [c8]Atsuya Hasegawa
, Srijita Kundu, Harumichi Nishimura:
On the Power of Quantum Distributed Proofs. PODC 2024: 220-230 - [i14]Shalev Ben-David, Srijita Kundu:
Oracle separation of QMA and QCMA with bounded adaptivity. CoRR abs/2402.00298 (2024) - [i13]Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura:
On the Power of Quantum Distributed Proofs. CoRR abs/2403.14108 (2024) - 2023
- [j5]Subrata Datta, Kalyani Mali, Sourav Das, Srijita Kundu, Sayanta Harh:
Rhythmus periodic frequent pattern mining without periodicity threshold. J. Ambient Intell. Humaniz. Comput. 14(7): 8551-8563 (2023) - [j4]Srijita Kundu, Ernest Y.-Z. Tan:
Composably secure device-independent encryption with certified deletion. Quantum 7: 1047 (2023) - [j3]Upendra Kapshikar, Srijita Kundu:
On the Hardness of the Minimum Distance Problem of Quantum Codes. IEEE Trans. Inf. Theory 69(10): 6293-6302 (2023) - 2022
- [j2]Srijita Kundu, Jamie Sikora, Ernest Y.-Z. Tan:
A device-independent protocol for XOR oblivious transfer. Quantum 6: 725 (2022) - [i12]Upendra Kapshikar, Srijita Kundu:
Diagonal distance of quantum codes and hardness of the minimum distance problem. CoRR abs/2203.04262 (2022) - 2021
- [c7]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. CCC 2021: 27:1-27:28 - [c6]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-To-Communication Lifting for Adversary Bounds. CCC 2021: 30:1-30:39 - [c5]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS 2021: 1285-1295 - [i11]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. CoRR abs/2106.04299 (2021) - [i10]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020) - [i9]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. CoRR abs/2008.08963 (2020) - [i8]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-to-Communication Lifting for Adversary Bounds. CoRR abs/2012.03415 (2020) - [i7]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [i6]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. CoRR abs/1903.11635 (2019) - 2018
- [c4]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [c3]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN 2018: 275-289 - 2017
- [c2]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [i5]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i4]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i3]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i2]Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay:
Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i1]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2014
- [c1]André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora:
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. TQC 2014: 76-87
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
