K. K. Krishnan Namboodiri

Orcid: 0000-0001-5473-0621

Affiliations:
  • Indian Institute of Science (IISc), Department of Electrical Communication Engineering, Bangalore, India


According to our database1, K. K. Krishnan Namboodiri authored at least 23 papers between 2021 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques.
CoRR, April, 2026

Fundamental Limits of Multi-User Distributed Computing of Linearly Separable Functions.
CoRR, January, 2026

Universal and Asymptotically Optimal Data and Task Allocation in Distributed Computing.
CoRR, January, 2026

A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks.
IEEE Commun. Lett., 2026

Placement Delivery Array Design for Coded Caching Scheme in Partially Cooperative Device-to-Device Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2026

2025
Fundamental Limits of Distributed Computing for Linearly Separable Functions.
CoRR, September, 2025

A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks.
CoRR, September, 2025

2024
Multi-Antenna Coded Caching for Multi-Access Networks with Cyclic Wrap-Around.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2024

Wireless MapReduce Arrays for Coded Distributed Computing.
Proceedings of the IEEE Information Theory Workshop, 2024

Placement Delivery Arrays for Coded Caching with Shared and Private Caches.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Coded Caching with Shared Caches and Private Caches.
Proceedings of the IEEE Information Theory Workshop, 2023

Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement.
Proceedings of the IEEE Information Theory Workshop, 2023

2022
Improved Lower Bounds for Multi-Access Coded Caching.
IEEE Trans. Commun., 2022

Multi-Access Coded Caching with Demand Privacy.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Multi-Access Coded Caching with Coded Placement.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays.
Proceedings of the IEEE Information Theory Workshop, 2022

A Secretive Coded Caching for Shared Cache Systems using Placement Delivery Arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2022

An Improved Lower Bound for Multi-Access Coded Caching.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
A Secretive Coded Caching for Shared Cache Systems using PDAs.
CoRR, 2021

Multi-Access Coded Caching with Secure Delivery.
Proceedings of the IEEE Information Theory Workshop, 2021

Optimal Demand Private Coded Caching for Users with Small Buffers.
Proceedings of the IEEE International Symposium on Information Theory, 2021


  Loading...