K. V. Rashmi

According to our database1, K. V. Rashmi authored at least 40 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions.
CoRR, 2020

A locality-based approach for coded computation.
CoRR, 2020

Online Versus Offline Rate in Streaming Codes for Variable-Size Messages.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Access-optimal Linear MDS Convertible Codes for All Parameters.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage.
CoRR, 2019

Parity Models: A General Framework for Coding-Based Resilience in ML Inference.
CoRR, 2019

Parity models: erasure-coded resilience for prediction serving systems.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

Vantage: optimizing video upload for time-shifted viewing of social live streams.
Proceedings of the ACM Special Interest Group on Data Communication, 2019

Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity.
Proceedings of the 17th USENIX Conference on File and Storage Technologies, 2019

2018
Information-Theoretically Secure Erasure Codes for Distributed Storage.
IEEE Trans. Inf. Theory, 2018

Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation.
CoRR, 2018

Streaming Codes For Variable-Size Arrivals.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes.
IEEE Trans. Inf. Theory, 2017

2016
EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Optimal systematic distributed storage codes with fast encoding.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Distributed Secret Dissemination Across a Network.
IEEE J. Sel. Top. Signal Process., 2015

Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth.
Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

DART: Dropouts meet Multiple Additive Regression Trees.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

One extra bit of download ensures perfectly private information retrieval.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Optimality of the product-matrix construction for secure MSR regenerating codes.
Proceedings of the 6th International Symposium on Communications, 2014

Fundamental limits on communication for oblivious updates in storage networks.
Proceedings of the IEEE Global Communications Conference, 2014

2013
Secure network coding for distributed secret sharing with low communication cost.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster.
Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems, 2013

2012
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions.
IEEE Trans. Inf. Theory, 2012

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff.
IEEE Trans. Inf. Theory, 2012

Secret Share Dissemination across a Network
CoRR, 2012

Regenerating codes for errors and erasures in distributed storage.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction.
IEEE Trans. Inf. Theory, 2011

Enabling node repair in any erasure code for distributed storage.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Information-Theoretically Secure Regenerating Codes for Distributed Storage.
Proceedings of the Global Communications Conference, 2011

2010
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
CoRR, 2010

The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment
CoRR, 2010

Regenerating Codes for Distributed Storage Networks.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Explicit and optimal codes for distributed storage.
Proceedings of the Information Theory and Applications Workshop, 2010

A flexible class of regenerating codes for distributed storage.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage
CoRR, 2009

Exact Regenerating Codes for Distributed Storage
CoRR, 2009


  Loading...