Yauhen Yakimenka

Orcid: 0000-0003-3030-2336

According to our database1, Yauhen Yakimenka authored at least 16 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

On csauthors.net:

Bibliography

2024
Straggler-Resilient Differentially Private Decentralized Learning.
IEEE J. Sel. Areas Inf. Theory, 2024

VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence.
CoRR, 2024

2023
Differentially-Private Collaborative Online Personalized Mean Estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Decentralized Sparse Matrix Multiplication Under Byzantine Attacks.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval.
IEEE Trans. Inf. Forensics Secur., 2022

Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval.
IEEE J. Sel. Areas Commun., 2022

2020
Failure Analysis of the Interval-Passing Algorithm for Compressed Sensing.
IEEE Trans. Inf. Theory, 2020

On the Capacity of Private Monomial Computation.
CoRR, 2020

2019
Stopping Redundancy Hierarchy Beyond the Minimum Distance.
IEEE Trans. Inf. Theory, 2019

BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels.
IEEE Trans. Inf. Theory, 2019

2018
Improved Redundant Parity-Check Based BP Decoding of LDPC Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Average spectra for ensembles of LDPC codes and applications.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Low complexity algorithm approaching the ML decoding of binary LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On failing sets of the interval-passing algorithm for compressed sensing.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Refined upper bounds on stopping redundancy of binary linear codes.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015


  Loading...