Exploring the bounds on the positive semidefinite rank. - Andrii Riazanov; Mikhail N. Vyalyi (CoRR, 2017)

Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow. - Andrii Riazanov; Yury Maximov; Michael Chertkov (ACC, 2018)

Beating Fredman-Komlós for perfect k-hashing. - Venkatesan Guruswami; Andrii Riazanov (Electron. Colloquium Comput. Complex., 2018)

Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity. - Venkatesan Guruswami; Andrii Riazanov; Min Ye 005 (Electron. Colloquium Comput. Complex., 2019)

Linear Shannon Capacity of Cayley Graphs. - Venkatesan Guruswami; Andrii Riazanov (ISIT, 2021)

Linear Programming Bounds for Almost-Balanced Binary Codes. - Venkatesan Guruswami; Andrii Riazanov (ISIT, 2021)

Beating Fredman-Komlós for perfect k-hashing. - Venkatesan Guruswami; Andrii Riazanov (J. Comb. Theory A, 2022)

Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity. - Venkatesan Guruswami; Andrii Riazanov; Min Ye 005 (IEEE Trans. Inf. Theory, 2022)