Andrii Riazanov

Orcid: 0000-0002-5173-7614

According to our database1, Andrii Riazanov authored at least 8 papers between 2017 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Beating Fredman-Komlós for perfect <i>k</i>-hashing.
J. Comb. Theory A, 2022

2021
Linear Programming Bounds for Almost-Balanced Binary Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Linear Shannon Capacity of Cayley Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity.
Electron. Colloquium Comput. Complex., 2019

Beating Fredman-Komlós for Perfect k-Hashing.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow.
Proceedings of the 2018 Annual American Control Conference, 2018

2017
Exploring the bounds on the positive semidefinite rank.
CoRR, 2017


  Loading...