default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYauhen Yakimenka
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin
, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially Private Decentralized Learning. IEEE J. Sel. Areas Inf. Theory 5: 407-423 (2024)- [c11]Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer:
Valid: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence. ISIT 2024: 2502-2507 - [i11]Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer:
VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence. CoRR abs/2405.07316 (2024) - 2023
- [c10]Sara Ghasvarianjahromi, Yauhen Yakimenka, Jörg Kliewer:
Decentralized Sparse Matrix Multiplication Under Byzantine Attacks. GLOBECOM 2023: 1723-1728 - [c9]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation. ISIT 2023: 737-742 - 2022
- [j5]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. IEEE J. Sel. Areas Commun. 40(3): 832-846 (2022) - [j4]Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval. IEEE Trans. Inf. Forensics Secur. 17: 3495-3510 (2022) - [c8]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning. ITW 2022: 708-713 - [i10]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning. CoRR abs/2212.03080 (2022) - 2021
- [c7]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. ISIT 2021: 2262-2267 - [i9]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. CoRR abs/2111.05160 (2021) - 2020
- [j3]Yauhen Yakimenka, Eirik Rosnes:
Failure Analysis of the Interval-Passing Algorithm for Compressed Sensing. IEEE Trans. Inf. Theory 66(4): 2466-2486 (2020) - [i8]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes:
On the Capacity of Private Monomial Computation. CoRR abs/2001.06320 (2020) - [i7]Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval. CoRR abs/2012.03902 (2020)
2010 – 2019
- 2019
- [j2]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels. IEEE Trans. Inf. Theory 65(3): 1677-1693 (2019) - [j1]Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov:
Stopping Redundancy Hierarchy Beyond the Minimum Distance. IEEE Trans. Inf. Theory 65(6): 3724-3737 (2019) - 2018
- [c6]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Improved Redundant Parity-Check Based BP Decoding of LDPC Codes. ISIT 2018: 1161-1165 - [i6]Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov:
Stopping Redundancy Hierarchy Beyond the Minimum Distance. CoRR abs/1804.06770 (2018) - [i5]Yauhen Yakimenka, Eirik Rosnes:
Failure Analysis of the Interval-Passing Algorithm for Compressed Sensing. CoRR abs/1806.05110 (2018) - 2017
- [c5]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance. ICMCTA 2017: 48-61 - [c4]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Average spectra for ensembles of LDPC codes and applications. ISIT 2017: 361-365 - [i4]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
BP-LED decoding algorithm for LDPC codes over AWGN channels. CoRR abs/1705.09507 (2017) - [i3]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance. CoRR abs/1707.01025 (2017) - 2016
- [c3]Yauhen Yakimenka, Eirik Rosnes:
On failing sets of the interval-passing algorithm for compressed sensing. Allerton 2016: 306-311 - [c2]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Low complexity algorithm approaching the ML decoding of binary LDPC codes. ISIT 2016: 2704-2708 - [i2]Yauhen Yakimenka, Eirik Rosnes:
On Failing Sets of the Interval-Passing Algorithm for Compressed Sensing. CoRR abs/1607.05001 (2016) - 2015
- [c1]Yauhen Yakimenka, Vitaly Skachek:
Refined upper bounds on stopping redundancy of binary linear codes. ITW 2015: 1-5 - 2014
- [i1]Yauhen Yakimenka, Vitaly Skachek:
Refined Upper Bounds on Stopping Redundancy of Binary Linear Codes. CoRR abs/1410.8753 (2014)
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-12 22:59 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:
