default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSayantan Chakraborty 0002
Person information
- affiliation: STCS, Tata Institute of Fundamental Research, India
Other persons with the same name
- Sayantan Chakraborty — disambiguation page
- Sayantan Chakraborty 0001 — Indian Institute of Technology, Kharagpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Sayantan Chakraborty, Rahul Jain, Pranab Sen:
One-Shot Non-Catalytic Distributed Purity Distillation. Allerton 2023: 1-8- [c7]Sayantan Chakraborty, Upendra Kapshikar:
A novel chain rule for one-shot entropic quantities via operational methods. ISIT 2023: 761-766 - [c6]Sayantan Chakraborty, Aditya Nema, Francesco Buscemi:
Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication. ISIT 2023: 980-984 - [i8]Sayantan Chakraborty, Upendra Kapshikar:
Chain rules for one-shot entropic quantities via operational methods. CoRR abs/2305.08521 (2023) - 2022
- [j1]Siddharth Bhandari, Sayantan Chakraborty:
Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs. SIAM J. Comput. 51(3): 20-54 (2022) - [c5]Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. ISIT 2022: 61-66 - [i7]Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. CoRR abs/2203.16157 (2022) - [i6]Sayantan Chakraborty, Aditya Nema, Francesco Buscemi:
One-shot purity distillation with local noisy operations and one-way classical communication. CoRR abs/2208.05628 (2022) - 2021
- [c4]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC. ISIT 2021: 623-627 - [c3]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. ISIT 2021: 628-633 - [c2]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
One-shot inner bounds for sending private classical information over a quantum MAC. ITW 2021: 1-6 - [i5]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. CoRR abs/2102.01766 (2021) - [i4]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC. CoRR abs/2102.02187 (2021) - [i3]Sayantan Chakraborty, Aditya Nema, Pranab Sen:
One-shot inner bounds for sending private classical information over a quantum MAC. CoRR abs/2105.06100 (2021) - 2020
- [c1]Siddharth Bhandari, Sayantan Chakraborty:
Improved bounds for perfect sampling of k-colorings in graphs. STOC 2020: 631-642
2010 – 2019
- 2019
- [i2]Siddharth Bhandari, Sayantan Chakraborty:
Perfect Sampling of graph k-colorings for k>3Δ. CoRR abs/1909.10323 (2019) - [i1]Siddharth Bhandari, Sayantan Chakraborty:
Improved bounds for perfect sampling of $k$-colorings in graphs. Electron. Colloquium Comput. Complex. TR19 (2019)
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-04-25 05:59 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:
