Sayantan Chakraborty

Orcid: 0009-0008-5353-5160

Affiliations:
  • STCS, Tata Institute of Fundamental Research, India


According to our database1, Sayantan Chakraborty authored at least 13 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Novel Chain Rules for One-Shot Entropic Quantities via Operational Methods.
IEEE Trans. Inf. Theory, September, 2025

2023
Chain rules for one-shot entropic quantities via operational methods.
CoRR, 2023

Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A novel chain rule for one-shot entropic quantities via operational methods.
Proceedings of the IEEE International Symposium on Information Theory, 2023

One-Shot Non-Catalytic Distributed Purity Distillation.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022
One-shot purity distillation with local noisy operations and one-way classical communication.
CoRR, 2022

Centralised multi link measurement compression with side information.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC.
CoRR, 2021

One-shot inner bounds for sending private classical information over a quantum MAC.
Proceedings of the IEEE Information Theory Workshop, 2021

Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting.
Proceedings of the IEEE International Symposium on Information Theory, 2021

A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Improved bounds for perfect sampling of k-colorings in graphs.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Perfect Sampling of graph k-colorings for k>3Δ.
CoRR, 2019


  Loading...