default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRawad Bitar
Person information
- affiliation: Technical University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Rawad Bitar
, Maximilian Egger, Antonia Wachter-Zeh, Marvin Xhemrishi:
Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off. IEEE Trans. Inf. Forensics Secur. 19: 5136-5150 (2024)- [c29]Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi:
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs. ISIT 2024: 452-457 - [c28]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels. ISIT 2024: 723-728 - [c27]Tim Janz, Hedongliang Liu, Rawad Bitar, Frank R. Kschischang:
Secure Storage Using Maximally Recoverable Locally Repairable Codes. ISIT 2024: 1450-1455 - [c26]Shreyas Jain, Luis Maßny, Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar:
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments. ISIT 2024: 3273-3278 - [i42]Christoph Hofmeister, Luis Maßny, Eitan Yaakobi, Rawad Bitar:
Byzantine-Resilient Gradient Coding through Local Gradient Computations. CoRR abs/2401.02380 (2024) - [i41]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Maximal-Capacity Discrete Memoryless Channel Identification. CoRR abs/2401.10204 (2024) - [i40]Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi:
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs. CoRR abs/2401.15733 (2024) - [i39]Shreyas Jain, Luis Maßny, Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar:
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments. CoRR abs/2401.16915 (2024) - [i38]Tim Janz, Hedongliang Liu, Rawad Bitar, Frank R. Kschischang:
Secure Storage using Maximally Recoverable Locally Repairable Codes. CoRR abs/2405.06098 (2024) - [i37]Yue Xia, Christoph Hofmeister, Maximilian Egger, Rawad Bitar:
Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy Compromises. CoRR abs/2405.08698 (2024) - [i36]Yue Xia, Christoph Hofmeister, Maximilian Egger, Rawad Bitar:
LoByITFL: Low Communication Secure and Private Federated Learning. CoRR abs/2405.19217 (2024) - [i35]Afonso de Sá Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar:
Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization. CoRR abs/2406.14362 (2024) - [i34]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels. CoRR abs/2407.01263 (2024) - [i33]Maximilian Egger, Ghadir Ayache, Rawad Bitar, Antonia Wachter-Zeh, Salim El Rouayheb:
Self-Duplicating Random Walks for Resilient Decentralized Learning on Graphs. CoRR abs/2407.11762 (2024) - [i32]Maximilian Egger, Christoph Hofmeister, Cem Kaya, Rawad Bitar, Antonia Wachter-Zeh:
Scalable and Reliable Over-the-Air Federated Edge Learning. CoRR abs/2407.11807 (2024) - 2023
- [j10]Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Function-Correcting Codes. IEEE Trans. Inf. Theory 69(9): 5604-5618 (2023) - [c25]Maximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar:
Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters. ISIT 2023: 54-59 - [c24]Maximilian Egger, Serge Kas Hanna, Rawad Bitar:
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. ISIT 2023: 1336-1341 - [c23]Christoph Hofmeister, Luis Maßny, Eitan Yaakobi, Rawad Bitar:
Trading Communication for Computation in Byzantine-Resilient Gradient Coding. ISIT 2023: 1985-1990 - [c22]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Maximal-Capacity Discrete Memoryless Channel Identification. ISIT 2023: 2248-2253 - [c21]Maximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh, Rawad Bitar:
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance. ISIT 2023: 2535-2540 - [i31]Christoph Hofmeister, Luis Maßny, Eitan Yaakobi, Rawad Bitar:
Trading Communication for Computation in Byzantine-Resilient Gradient Coding. CoRR abs/2303.13231 (2023) - [i30]Maximilian Egger, Serge Kas Hanna, Rawad Bitar:
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. CoRR abs/2304.08589 (2023) - [i29]Maximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar:
Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters. CoRR abs/2306.14088 (2023) - [i28]Maximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh, Rawad Bitar:
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance. CoRR abs/2306.15134 (2023) - [i27]Rawad Bitar, Maximilian Egger, Antonia Wachter-Zeh, Marvin Xhemrishi:
Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off. CoRR abs/2308.06413 (2023) - [i26]Zirui Deng, Vinayak Ramkumar, Rawad Bitar, Netanel Raviv:
Private Inference in Quantized Models. CoRR abs/2311.13686 (2023) - 2022
- [j9]Christoph Hofmeister, Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound. IEEE J. Sel. Areas Inf. Theory 3(2): 275-285 (2022) - [j8]Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Adaptive Private Distributed Matrix Multiplication. IEEE Trans. Inf. Theory 68(4): 2653-2673 (2022) - [j7]Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Multiple Criss-Cross Insertion and Deletion Correcting Codes. IEEE Trans. Inf. Theory 68(6): 3767-3779 (2022) - [c20]Evagoras Stylianou, Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays. ISIT 2022: 814-819 - [c19]Marvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh:
Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees. ISIT 2022: 1028-1033 - [c18]Netanel Raviv, Rawad Bitar, Eitan Yaakobi:
Information Theoretic Private Inference in Quantized Models. ISIT 2022: 1641-1646 - [c17]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz:
Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits. ISIT 2022: 1653-1658 - [c16]Marvin Xhemrishi, Maximilian Egger, Rawad Bitar:
Efficient Private Storage of Sparse Machine Learning Data. ITW 2022: 214-219 - [i25]Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz:
Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits. CoRR abs/2202.08302 (2022) - [i24]Marvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh:
Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees. CoRR abs/2203.01728 (2022) - [i23]Marvin Xhemrishi, Maximilian Egger, Rawad Bitar:
Efficient Private Storage of Sparse Machine Learning Data. CoRR abs/2206.06676 (2022) - [i22]Serge Kas Hanna, Rawad Bitar, Parimal Parag, Venkat Dasari, Salim El Rouayheb:
Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning. CoRR abs/2208.03134 (2022) - [i21]Evagoras Stylianou, Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays. CoRR abs/2208.05412 (2022) - [i20]Luis Maßny, Christoph Hofmeister, Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh:
Nested Gradient Codes for Straggler Mitigation in Distributed Machine Learning. CoRR abs/2212.08580 (2022) - 2021
- [j6]Rawad Bitar, Yuxuan Xing, Yasaman Keshtkarjahromi, Venkat R. Dasari, Salim El Rouayheb, Hulya Seferoglu:
Private and rateless adaptive coded matrix-vector multiplication. EURASIP J. Wirel. Commun. Netw. 2021(1): 15 (2021) - [j5]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding With Myopic Adversaries. IEEE J. Sel. Areas Inf. Theory 2(4): 1108-1119 (2021) - [j4]Rawad Bitar, Lorenz Welter, Ilia Smagloy, Antonia Wachter-Zeh, Eitan Yaakobi:
Criss-Cross Insertion and Deletion Correcting Codes. IEEE Trans. Inf. Theory 67(12): 7999-8015 (2021) - [c15]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding with Myopic Adversaries. ISIT 2021: 72-77 - [c14]Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Function-Correcting Codes. ISIT 2021: 1290-1295 - [c13]Serge Kas Hanna, Rawad Bitar:
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy. ISIT 2021: 1985-1990 - [c12]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. ISIT 2021: 1991-1996 - [c11]Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Multiple Criss-Cross Deletion-Correcting Codes. ISIT 2021: 2798-2803 - [i19]Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Adaptive Private Distributed Matrix Multiplication. CoRR abs/2101.05681 (2021) - [i18]Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Multiple Criss-Cross Deletion-Correcting Codes. CoRR abs/2102.02727 (2021) - [i17]Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Function-Correcting Codes. CoRR abs/2102.03094 (2021) - [i16]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding with Myopic Adversaries. CoRR abs/2102.09885 (2021) - [i15]Serge Kas Hanna, Rawad Bitar:
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy. CoRR abs/2105.00212 (2021) - [i14]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. CoRR abs/2105.02298 (2021) - [i13]Christoph Hofmeister, Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound. CoRR abs/2108.05742 (2021) - 2020
- [j3]Rawad Bitar, Mary Wootters, Salim El Rouayheb:
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning. IEEE J. Sel. Areas Inf. Theory 1(1): 277-291 (2020) - [j2]Rawad Bitar, Parimal Parag, Salim El Rouayheb:
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes. IEEE Trans. Commun. 68(8): 4609-4619 (2020) - [c10]Serge Kas Hanna, Rawad Bitar, Parimal Parag, Venkat Dasari, Salim El Rouayheb:
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers. ICASSP 2020: 4262-4266 - [c9]Rawad Bitar, Sidharth Jaggi:
Communication Efficient Secret Sharing in the Presence of Malicious Adversary. ISIT 2020: 548-553 - [c8]Rawad Bitar, Ilia Smagloy, Lorenz Welter, Antonia Wachter-Zeh, Eitan Yaakobi:
Criss-Cross Deletion Correcting Codes. ISITA 2020: 304-308 - [c7]Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Fountain Codes for Private Distributed Matrix-Matrix Multiplication. ISITA 2020: 480-484 - [i12]Rawad Bitar, Sidharth Jaggi:
Communication Efficient Secret Sharing in the Presence of Malicious Adversary. CoRR abs/2002.03374 (2020) - [i11]Serge Kas Hanna, Rawad Bitar, Parimal Parag, Venkat Dasari, Salim El Rouayheb:
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers. CoRR abs/2002.11005 (2020) - [i10]Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Rateless Codes for Private Distributed Matrix-Matrix Multiplication. CoRR abs/2004.12925 (2020) - [i9]Rawad Bitar, Ilia Smagloy, Lorenz Welter, Antonia Wachter-Zeh, Eitan Yaakobi:
Criss-Cross Deletion Correcting Codes. CoRR abs/2004.14740 (2020)
2010 – 2019
- 2019
- [c6]Yasaman Keshtkarjahromi, Rawad Bitar, Venkat R. Dasari, Salim El Rouayheb, Hulya Seferoglu:
Secure Coded Cooperative Computation at the Heterogeneous Edge against Byzantine Attacks. GLOBECOM 2019: 1-6 - [c5]Rawad Bitar, Mary Wootters, Salim El Rouayheb:
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning. ITW 2019: 1-5 - [i8]Rawad Bitar, Mary Wootters, Salim El Rouayheb:
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning. CoRR abs/1905.05383 (2019) - [i7]Yasaman Keshtkarjahromi, Rawad Bitar, Venkat R. Dasari, Salim El Rouayheb, Hulya Seferoglu:
Secure Coded Cooperative Computation at the Heterogeneous Edge against Byzantine Attacks. CoRR abs/1908.05385 (2019) - [i6]Rawad Bitar, Yuxuan Xing, Yasaman Keshtkarjahromi, Venkat R. Dasari, Salim El Rouayheb, Hulya Seferoglu:
Private and Rateless Adaptive Coded Matrix-Vector Multiplication. CoRR abs/1909.12611 (2019) - 2018
- [j1]Rawad Bitar, Salim El Rouayheb:
Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads. IEEE Trans. Inf. Theory 64(2): 933-943 (2018) - [c4]Rawad Bitar, Salim El Rouayheb:
Staircase-PIR: Universally Robust Private Information Retrieval. ITW 2018: 1-5 - [i5]Rawad Bitar, Parimal Parag, Salim El Rouayheb:
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes. CoRR abs/1802.02640 (2018) - [i4]Rawad Bitar, Salim El Rouayheb:
Staircase-PIR: Universally Robust Private Information Retrieval. CoRR abs/1806.08825 (2018) - 2017
- [c3]Rawad Bitar, Parimal Parag, Salim El Rouayheb:
Minimizing latency for secure distributed computing. ISIT 2017: 2900-2904 - [i3]Rawad Bitar, Parimal Parag, Salim El Rouayheb:
Minimizing Latency for Secure Distributed Computing. CoRR abs/1703.01504 (2017) - 2016
- [c2]Rawad Bitar, Salim El Rouayheb:
Staircase codes for secret sharing with optimal communication and read overheads. ISIT 2016: 1396-1400 - 2015
- [c1]Rawad Bitar, Salim El Rouayheb:
Securing data against limited-knowledge adversaries in distributed storage systems. ISIT 2015: 2847-2851 - [i2]Rawad Bitar, Salim El Rouayheb:
Securing Data against Limited-Knowledge Adversaries in Distributed Storage Systems. CoRR abs/1504.05999 (2015) - [i1]Rawad Bitar, Salim El Rouayheb:
Staircase Codes for Secret Sharing with Optimal Communication and Read Overheads. CoRR abs/1512.02990 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
