Viveck R. Cadambe

Orcid: 0000-0001-6786-8785

Affiliations:
  • MIT, Cambridge, USA


According to our database1, Viveck R. Cadambe authored at least 82 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Game of Coding: Beyond Trusted Majorities.
CoRR, 2024

2023
Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise.
CoRR, 2023

Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Ares: Adaptive, Reconfigurable, Erasure coded, Atomic Storage.
ACM Trans. Storage, 2022

LEGOStore: A Linearizable Geo-Distributed Store Combining Replication and Erasure Coding.
Proc. VLDB Endow., 2022

Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off Limits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Numerically Stable Polynomially Coded Computing.
IEEE Trans. Inf. Theory, 2021

ϵ-Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication.
IEEE J. Sel. Areas Inf. Theory, 2021

Guest Editorial for Special Issue on Coded Computing.
IEEE J. Sel. Areas Inf. Theory, 2021

CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding.
CoRR, 2021

E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On the Optimal Recovery Threshold of Coded Matrix Multiplication.
IEEE Trans. Inf. Theory, 2020

Fundamental Limits of Erasure-Coded Key-Value Stores With Side Information.
IEEE Trans. Commun., 2020

Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing.
Proc. IEEE, 2020

CassandrEAS: Highly Available and Storage-Efficient Distributed Key-Value Store with Erasure Coding.
Proceedings of the 19th IEEE International Symposium on Network Computing and Applications, 2020

3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication.
Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019
"Short-Dot": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products.
IEEE Trans. Inf. Theory, 2019

Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores.
IEEE Trans. Commun., 2019

Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Trading Redundancy for Communication: Speeding up Distributed SGD for Non-convex Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Lagrange Coded Computing with Sparsity Constraints.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Multi-Version Coding - An Information-Theoretic Perspective of Consistent Distributed Storage.
IEEE Trans. Inf. Theory, 2018

Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver.
CoRR, 2018

Codes for Distributed Finite Alphabet Matrix-Vector Multiplication.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Multi-version Coding with Side Information.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Cross-Iteration Coded Computing.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
File Updates Under Random/Arbitrary Insertions and Deletions.
IEEE Trans. Inf. Theory, 2017

A coded shared atomic memory algorithm for message passing architectures.
Distributed Comput., 2017

Multi-version Coding for Consistent Distributed Storage of Correlated Data Updates.
CoRR, 2017

Linear network coding for two-unicast-Z networks: A commutative algebraic perspective and fundamental limits.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Coded convolution for parallel and distributed computing within a deadline.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Alignment-Based Network Coding for Two-Unicast-Z Networks.
IEEE Trans. Inf. Theory, 2016

Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations.
IEEE Trans. Inf. Theory, 2016

Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Consistent distributed storage of correlated data updates via multi-version coding.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015
Bounds on the Size of Locally Recoverable Codes.
IEEE Trans. Inf. Theory, 2015

Alphabet-size dependent bounds for exact repair in distributed storage.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Index Coding - An Interference Alignment Perspective.
IEEE Trans. Inf. Theory, 2014

A recursive coding algorithm for two-unicast-Z networks.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Multi-version coding in distributed storage.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

A signal model for forensic DNA mixtures.
Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage.
IEEE Trans. Inf. Theory, 2013

An upper bound on the size of locally recoverable codes.
Proceedings of the International Symposium on Network Coding, 2013

On the tightness of the generalized network sharing bound for the two-unicast-Z network.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Integer-forcing interference alignment.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Feedback interference alignment: Exact alignment for three users in two time slots.
Proceedings of IEEE International Conference on Communications, 2013

Asymmetric compute-and-forward.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Interference Alignment and the Generalized Degrees of Freedom of the X Channel.
IEEE Trans. Inf. Theory, 2012

Multi-way relay based deterministic broadcast with side information: Pair-wise network coding is sum-capacity optimal.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

An Edge Reduction Lemma for linear network coding and an application to two-unicast networks.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks.
IEEE Trans. Inf. Theory, 2011

Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
CoRR, 2011

Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Repair optimal erasure codes through hadamard designs.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Tensor product based subspace interference alignment for network coding applications.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

Polynomial length MDS codes with optimal repair in distributed storage.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

Session TP8a4: Wireless networks.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010
Interference alignment with asymmetric complex signaling: settling the Høst-Madsen-Nosratinia conjecture.
IEEE Trans. Inf. Theory, 2010

Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
CoRR, 2010

Sum-capacity and the unique separability of the parallel Gaussian MAC-Z-BC network.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Interference Alignment on the Deterministic Channel and Application to Fully Connected Gaussian Interference Networks.
IEEE Trans. Inf. Theory, 2009

Parallel Gaussian interference channels are not always separable.
IEEE Trans. Inf. Theory, 2009

Interference alignment and the degrees of freedom of wireless X networks.
IEEE Trans. Inf. Theory, 2009

Degrees of freedom of wireless networks with relays, feedback, cooperation, and full duplex operation.
IEEE Trans. Inf. Theory, 2009

Interference Alignment and a Noisy Interference Regime for Many-to-One Interference Channels
CoRR, 2009

The capacity region of a class of deterministic Z channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Interference alignment with asymmetric complex signaling.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

Interference alignment via random codes and he capacity of a class of deterministic interference channels.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Interference Alignment and Degrees of Freedom of the K-User Interference Channel.
IEEE Trans. Inf. Theory, 2008

On the Capacity and Generalized Degrees of Freedom of the X Channel
CoRR, 2008

Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation
CoRR, 2008

Interference alignment on the deterministic channel and application to fully connected AWGN interference networks.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Degrees of freedom of wireless X networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Can feedback, cooperation, relays and full duplex operation increase the degrees of freedom of wireless networks?
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Duality and stability regions of multi-rate broadcast and multiple access networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel.
Proceedings of IEEE International Conference on Communications, 2008

Approaching the Capacity of Wireless Networks through Distributed Interference Alignment.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Generalized degrees of freedom of the (noisy) X channel.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008


  Loading...