Rawad Bitar

Orcid: 0000-0002-4421-1024

Affiliations:
  • Technical University of Munich, Germany


According to our database1, Rawad Bitar authored at least 40 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments.
CoRR, 2024

Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs.
CoRR, 2024

Byzantine-Resilient Gradient Coding through Local Gradient Computations.
CoRR, 2024

2023
Function-Correcting Codes.
IEEE Trans. Inf. Theory, September, 2023

Private Inference in Quantized Models.
CoRR, 2023

Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off.
CoRR, 2023

Trading Communication for Computation in Byzantine-Resilient Gradient Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Maximal-Capacity Discrete Memoryless Channel Identification.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Multiple Criss-Cross Insertion and Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2022

Adaptive Private Distributed Matrix Multiplication.
IEEE Trans. Inf. Theory, 2022

Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound.
IEEE J. Sel. Areas Inf. Theory, 2022

Nested Gradient Codes for Straggler Mitigation in Distributed Machine Learning.
CoRR, 2022

Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning.
CoRR, 2022

Efficient Private Storage of Sparse Machine Learning Data.
Proceedings of the IEEE Information Theory Workshop, 2022

Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Information Theoretic Private Inference in Quantized Models.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Criss-Cross Insertion and Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2021

Network Coding With Myopic Adversaries.
IEEE J. Sel. Areas Inf. Theory, 2021

Private and rateless adaptive coded matrix-vector multiplication.
EURASIP J. Wirel. Commun. Netw., 2021

Multiple Criss-Cross Deletion-Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Optimal Codes Correcting Localized Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes.
IEEE Trans. Commun., 2020

Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning.
IEEE J. Sel. Areas Inf. Theory, 2020

Rateless Codes for Private Distributed Matrix-Matrix Multiplication.
CoRR, 2020

Fountain Codes for Private Distributed Matrix-Matrix Multiplication.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Criss-Cross Deletion Correcting Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Communication Efficient Secret Sharing in the Presence of Malicious Adversary.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Secure Coded Cooperative Computation at the Heterogeneous Edge against Byzantine Attacks.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018
Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads.
IEEE Trans. Inf. Theory, 2018

Staircase-PIR: Universally Robust Private Information Retrieval.
Proceedings of the IEEE Information Theory Workshop, 2018

2017
Minimizing latency for secure distributed computing.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2015
Securing data against limited-knowledge adversaries in distributed storage systems.
Proceedings of the IEEE International Symposium on Information Theory, 2015


  Loading...