Aditya Ramamoorthy

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 74

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

IEEE/ACM Trans. Netw.

Publications

Ruoyu Meng, Aditya Ramamoorthy
Quantum advantage in zero-error function computation with side information. CoRR (2024)
Konstantinos Konstantinidis, Namrata Vaswani, Aditya Ramamoorthy
Detection and Mitigation of Byzantine Attacks in Distributed Training. IEEE/ACM Trans. Netw. 32 (2) (2024)
Aditya Ramamoorthy, Ruoyu Meng, Vrinda S. Girimaji
Leveraging partial stragglers within gradient coding. CoRR (2024)
Kyungrak Son, Aditya Ramamoorthy
Coded matrix computation with gradient coding. CoRR (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Distributed Matrix Computations with Low-weight Encodings. CoRR (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Distributed Matrix Computations with Low-weight Encodings. ISIT (2023)
Kyungrak Son, Aditya Ramamoorthy
Coded matrix computation with gradient coding. ISIT (2023)
Ruoyu Meng, Aditya Ramamoorthy
Communication complexity of entanglement assisted multi-party computation. CoRR (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Coded Matrix Computations for D2D-enabled Linearized Federated Learning. CoRR (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Coded Matrix Computations for D2D-Enabled Linearized Federated Learning. ICASSP (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. Allerton (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. CoRR (2023)
Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton
Distributed Matrix Computations With Low-Weight Encodings. IEEE J. Sel. Areas Inf. Theory 4 (2023)
Anindya Bijoy Das, Aditya Ramamoorthy
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers. IEEE Trans. Inf. Theory 68 (6) (2022)
Aditya Ramamoorthy, Li Tang
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings. IEEE Trans. Inf. Theory 68 (4) (2022)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Aspis: Robust Detection for Distributed Learning. ISIT (2022)
Anindya Bijoy Das, Aditya Ramamoorthy
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations. ISIT (2022)
Anindya Bijoy Das, Aditya Ramamoorthy
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. IEEE J. Sel. Areas Inf. Theory 3 (2) (2022)
Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy
Federated Over-Air Subspace Tracking From Incomplete and Corrupted Data. IEEE Trans. Signal Process. 70 (2022)
Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy
Federated Over-Air Robust Subspace Tracking from Missing Data. ICASSP (2022)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Efficient Detection and Filtering Systems for Distributed Training. CoRR (2022)
Konstantinos Konstantinidis, Aditya Ramamoorthy
ByzShield: An Efficient and Robust System for Distributed Training. MLSys (2021)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Aspis: A Robust Detection System for Distributed Learning. CoRR (2021)
Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. ISIT (2021)
Aditya Ramamoorthy, Li Tang
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. ISIT (2021)
Kyungrak Son, Aditya Ramamoorthy, Wan Choi
Distributed Matrix Multiplication Using Group Algebra for On-Device Edge Computing. IEEE Signal Process. Lett. 28 (2021)
Anindya Bijoy Das, Aditya Ramamoorthy
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. CoRR (2021)
Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. IEEE Trans. Inf. Theory 67 (9) (2021)
Anindya Bijoy Das, Aditya Ramamoorthy
Coded sparse matrix computation schemes that leverage partial stragglers. ISIT (2021)
Anindya Bijoy Das, Aditya Ramamoorthy
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. ITW (2021)
Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang
Straggler-resistant distributed matrix computation via coding theory. CoRR (2020)
Anindya Bijoy Das, Aditya Ramamoorthy
Coded sparse matrix computation schemes that leverage partial stragglers. CoRR (2020)
Hooshang Ghasemi, Aditya Ramamoorthy
Asynchronous Coded Caching With Uncoded Prefetching. IEEE/ACM Trans. Netw. 28 (5) (2020)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Resolvable Designs for Speeding Up Distributed Computing. IEEE/ACM Trans. Netw. 28 (4) (2020)
Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang
Straggler-Resistant Distributed Matrix Computation via Coding Theory: Removing a Bottleneck in Large-Scale Data Processing. IEEE Signal Process. Mag. 37 (3) (2020)
Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy
Federated Over-the-Air Subspace Learning from Incomplete Data. CoRR (2020)
Konstantinos Konstantinidis, Aditya Ramamoorthy
ByzShield: An Efficient and Robust System for Distributed Training. CoRR (2020)
Hooshang Ghasemi, Aditya Ramamoorthy
Asynchronous Coded Caching. CoRR (2019)
Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. CoRR (2019)
Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani
Random Convolutional Coding for Robust and Straggler Resilient Distributed Matrix Computation. CoRR (2019)
Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy
Erasure Coding for Distributed Matrix Multiplication for Matrices With Bounded Entries. IEEE Commun. Lett. 23 (1) (2019)
Anindya Bijoy Das, Aditya Ramamoorthy
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. ISIT (2019)
Aditya Ramamoorthy, Li Tang
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. CoRR (2019)
Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. ISIT (2019)
Konstantinos Konstantinidis, Aditya Ramamoorthy
CAMR: Coded Aggregated MapReduce. CoRR (2019)
Konstantinos Konstantinidis, Aditya Ramamoorthy
CAMR: Coded Aggregated MapReduce. ISIT (2019)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Resolvable Designs for Speeding up Distributed Computing. CoRR (2019)
Anindya Bijoy Das, Aditya Ramamoorthy
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. CoRR (2019)
Ardhendu Tripathy, Aditya Ramamoorthy
Zero-error Function Computation on a Directed Acyclic Network. CoRR (2018)
Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy
Erasure coding for distributed matrix multiplication for matrices with bounded entries. CoRR (2018)
Li Tang, Aditya Ramamoorthy
Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes. IEEE Trans. Inf. Theory 64 (4) (2018)
Bin Li, Aditya Ramamoorthy, R. Srikant
Mean-Field Analysis of Coding Versus Replication in Large Data Storage Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 3 (1) (2018)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Leveraging Coding Techniques for Speeding up Distributed Computing. CoRR (2018)
Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy
LES: Codes for Coded Computation that Leverage Stragglers. ITW (2018)
Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy
LES: Codes for Coded Computation that Leverage Stragglers. CoRR (2018)
Konstantinos Konstantinidis, Aditya Ramamoorthy
Leveraging Coding Techniques for Speeding up Distributed Computing. GLOBECOM (2018)
Ardhendu Tripathy, Aditya Ramamoorthy
Zero-error Function Computation on a Directed Acyclic Network. ITW (2018)
Ardhendu Tripathy, Aditya Ramamoorthy
Sum-Networks From Incidence Structures: Construction and Capacity Analysis. IEEE Trans. Inf. Theory 64 (5) (2018)
Li Tang, Aditya Ramamoorthy
Low subpacketization schemes for coded caching. ISIT (2017)
Li Tang, Aditya Ramamoorthy
Low Subpacketization Schemes for Coded Caching. CoRR (2017)
Hooshang Ghasemi, Aditya Ramamoorthy
Asynchronous coded caching. ISIT (2017)
Hooshang Ghasemi, Aditya Ramamoorthy
Improved Lower Bounds for Coded Caching. IEEE Trans. Inf. Theory 63 (7) (2017)
Hooshang Ghasemi, Aditya Ramamoorthy
Algorithms for asynchronous coded caching. ACSSC (2017)
Ardhendu Tripathy, Aditya Ramamoorthy
On computation rates for arithmetic sum. ISIT (2016)
Li Tang, Aditya Ramamoorthy
Coded Caching with Low Subpacketization Levels. GLOBECOM Workshops (2016)
Ardhendu Tripathy, Aditya Ramamoorthy
On Computation Rates for Arithmetic Sum. CoRR (2016)
Li Tang, Aditya Ramamoorthy
Coded caching for networks with the resolvability property. ISIT (2016)
Ardhendu Tripathy, Aditya Ramamoorthy
Sum-networks from incidence structures: construction and capacity analysis. CoRR (2016)
Li Tang, Aditya Ramamoorthy
Coded Caching with Low Subpacketization Levels. CoRR (2016)
Hooshang Ghasemi, Aditya Ramamoorthy
Further results on lower bounds for coded caching. ISIT (2016)
Ardhendu Tripathy, Aditya Ramamoorthy
Sum-networks from undirected graphs: construction and capacity analysis. CoRR (2016)
Bin Li, Aditya Ramamoorthy, R. Srikant
Mean-field-analysis of coding versus replication in cloud storage systems. INFOCOM (2016)
Oktay Olmez, Aditya Ramamoorthy
Fractional Repetition Codes With Flexible Repair From Combinatorial Designs. IEEE Trans. Inf. Theory 62 (4) (2016)
Li Tang, Aditya Ramamoorthy
Coded Caching for Networks with the Resolvability Property. CoRR (2016)
Ardhendu Tripathy, Aditya Ramamoorthy
Capacity of Sum-networks for Different Message Alphabets. CoRR (2015)
Ardhendu Tripathy, Aditya Ramamoorthy
Capacity of sum-networks for different message alphabets. ISIT (2015)
Hooshang Ghasemi, Aditya Ramamoorthy
Improved Lower Bounds for Coded Caching. CoRR (2015)
Hooshang Ghasemi, Aditya Ramamoorthy
Improved lower bounds for coded caching. ISIT (2015)
Ardhendu Tripathy, Aditya Ramamoorthy
Sum-networks from undirected graphs: Construction and capacity analysis. Allerton (2014)
Shurui Huang, Aditya Ramamoorthy
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks. IEEE/ACM Trans. Netw. 22 (1) (2014)
Oktay Olmez, Aditya Ramamoorthy
Fractional repetition codes with flexible repair from combinatorial designs. CoRR (2014)
Oktay Olmez, Aditya Ramamoorthy
Replication based storage systems with local repair CoRR (2013)
Shurui Huang, Aditya Ramamoorthy
An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis. IEEE Trans. Commun. 61 (7) (2013)
Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy
PREMIER - PRobabilistic error-correction using Markov inference in errored reads. ISIT (2013)
Shurui Huang, Aditya Ramamoorthy
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks CoRR (2013)
Oktay Olmez, Aditya Ramamoorthy
Constructions of fractional repetition codes from combinatorial designs. ACSSC (2013)
Aditya Ramamoorthy, Michael Langberg
Communicating the Sum of Sources Over a Network. IEEE J. Sel. Areas Commun. 31 (4) (2013)
Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy
PREMIER Turbo: Probabilistic error-correction using Markov inference in errored reads using the turbo principle. GlobalSIP (2013)
Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka
Error Analysis for ML Sequence Detection in ISI Channels With Gauss Markov Noise. IEEE Trans. Signal Process. 61 (14) (2013)
Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy
PREMIER - PRobabilistic Error-correction using Markov Inference in Errored Reads CoRR (2013)
Sayan Ghosal, Govind Saraswat, Aditya Ramamoorthy, Murti V. Salapaka
Topography detection using innovations mismatch method for high speed and high density dynamic mode AFM. ACC (2013)
Oktay Olmez, Aditya Ramamoorthy
Replication based storage systems with local repair. NetCod (2013)
Lei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin
Degrees of Freedom Region for an Interference Network With General Message Demands. IEEE Trans. Inf. Theory 58 (6) (2012)
Shizheng Li, Aditya Ramamoorthy
Multiple-Source Slepian-Wolf Coding Under a Linear Equation Correlation Model. IEEE Trans. Commun. 60 (9) (2012)
Oktay Olmez, Aditya Ramamoorthy
Repairable replication-based storage systems using resolvable designs. Allerton Conference (2012)
Aditya Ramamoorthy, Vwani P. Roychowdhury, Sudhir Kumar Singh
Selfish Distributed Compression Over Networks: Correlation Induces Anarchy. IEEE Trans. Inf. Theory 58 (5) (2012)
Oktay Olmez, Aditya Ramamoorthy
Repairable Replication-based Storage Systems Using Resolvable Designs CoRR (2012)
Shurui Huang, Aditya Ramamoorthy
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks. ITA (2012)
Aditya Ramamoorthy
Minimum Cost Distributed Source Coding Over a Network. IEEE Trans. Inf. Theory 57 (1) (2011)
Shurui Huang, Aditya Ramamoorthy
An achievable region for the double unicast problem based on a minimum cut analysis. ITW (2011)

Aditya Ramamoorthy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aditya Ramamoorthy