default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerge Kas Hanna
Person information
- affiliation: Côte d'Azur University, Nice, France
- affiliation (former): Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Okko Makkonen, Sampo Niemelä, Camilla Hollanti, Serge Kas Hanna:
Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data. EUSIPCO 2024: 1167-1171- [c10]Serge Kas Hanna:
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage. ISIT 2024: 663-668 - [i14]Serge Kas Hanna:
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage. CoRR abs/2402.01244 (2024) - [i13]Okko Makkonen, Sampo Niemelä, Camilla Hollanti, Serge Kas Hanna:
Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data. CoRR abs/2404.03524 (2024) - 2023
- [j3]Serge Kas Hanna
:
Optimal Codes Detecting Deletions in Concatenated Binary Strings Applied to Trace Reconstruction. IEEE Trans. Inf. Theory 69(9): 5687-5700 (2023) - [c9]Serge Kas Hanna, Zhiyuan Tan, Wen Xu, Antonia Wachter-Zeh:
Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication. ICASSP 2023: 1-5 - [c8]Maximilian Egger, Serge Kas Hanna, Rawad Bitar:
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. ISIT 2023: 1336-1341 - [i12]Serge Kas Hanna, Zhiyuan Tan, Wen Xu, Antonia Wachter-Zeh:
Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication. CoRR abs/2302.08644 (2023) - [i11]Maximilian Egger, Serge Kas Hanna, Rawad Bitar:
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. CoRR abs/2304.08589 (2023) - [i10]Serge Kas Hanna:
Optimal Codes Detecting Deletions in Concatenated Binary Strings Applied to Trace Reconstruction. CoRR abs/2304.09839 (2023) - 2022
- [c7]Serge Kas Hanna:
Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities. ISIT 2022: 360-365 - [i9]Serge Kas Hanna:
Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities. CoRR abs/2207.05126 (2022) - [i8]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) - 2021
- [j2]Serge Kas Hanna, Salim El Rouayheb:
Codes for Correcting Localized Deletions. IEEE Trans. Inf. Theory 67(4): 2206-2216 (2021) - [c6]Serge Kas Hanna, Rawad Bitar:
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy. ISIT 2021: 1985-1990 - [c5]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. ISIT 2021: 1991-1996 - [i7]Serge Kas Hanna, Rawad Bitar:
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy. CoRR abs/2105.00212 (2021) - [i6]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. CoRR abs/2105.02298 (2021) - 2020
- [c4]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 - [i5]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)
2010 – 2019
- 2019
- [j1]Serge Kas Hanna, Salim El Rouayheb:
Guess & Check Codes for Deletions, Insertions, and Synchronization. IEEE Trans. Inf. Theory 65(1): 3-15 (2019) - [c3]Serge Kas Hanna, Salim El Rouayheb:
List Decoding of Deletions Using Guess & Check Codes. ISIT 2019: 2374-2378 - 2018
- [i4]Serge Kas Hanna, Salim El Rouayheb:
List Decoding of Deletions Using Guess & Check Codes. CoRR abs/1810.07281 (2018) - 2017
- [c2]Serge Kas Hanna, Salim El Rouayheb:
Correcting bursty and localized deletions using guess & check codes. Allerton 2017: 9-16 - [c1]Serge Kas Hanna, Salim El Rouayheb:
Guess & check codes for deletions and synchronization. ISIT 2017: 2693-2697 - [i3]Serge Kas Hanna, Salim El Rouayheb:
Guess & Check Codes for Deletions and Synchronization. CoRR abs/1702.04466 (2017) - [i2]Serge Kas Hanna, Salim El Rouayheb:
Guess & Check Codes for Deletions, Insertions, and Synchronization. CoRR abs/1705.09569 (2017) - [i1]Serge Kas Hanna, Salim El Rouayheb:
Correcting Bursty and Localized Deletions Using Guess & Check Codes. CoRR abs/1711.01941 (2017)
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-11-07 21:35 CET 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:
