Hari Hara Suthan C

Orcid: 0000-0003-1363-606X

According to our database1, Hari Hara Suthan C authored at least 13 papers between 2017 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Quantum Machine Learning for Distributed Quantum Protocols with Local Operations and Noisy Classical Communications.
Entropy, February, 2023

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels.
Proceedings of the IEEE Information Theory Workshop, 2023

Learning Quantum Entanglement Distillation With Noisy Classical Communications.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Learning Distributed Quantum State Discrimination with Noisy Classical Communications.
CoRR, 2022

Robust Distributed Bayesian Learning with Stragglers via Consensus Monte Carlo.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry.
IEEE Trans. Inf. Theory, 2021

Coded Consensus Monte Carlo: Robust One-Shot Distributed Bayesian Learning with Stragglers.
CoRR, 2021

2020
Subexponential and Linear Subpacketization Coded Caching via Line Graphs and Projective Geometry.
CoRR, 2020

2019
Cache-Aided Interference Management with Subexponential Subpacketization.
CoRR, 2019

Coded Caching via Projective Geometry: A new low subpacketization scheme.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Projective Geometry based Coded Caching Schemes with Subexponential and Linear Subpacketizations.
Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D Networks.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2017
An improved secretive coded caching scheme exploiting common demands.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017


  Loading...