1. Size-depth tradeoffs for Boolean formulae
2. Lower bounds for cutting planes proofs with small coefficients
3. Mark Braverman , Klim Efremenko , Ran Gelles , and Michael A. Yitayew . 2019 . Optimal Short-Circuit Resilient Formulas. In Computational Complexity Conference (CCC) , Vol. 137 . 10: 1-10 : 22. Mark Braverman, Klim Efremenko, Ran Gelles, and Michael A. Yitayew. 2019. Optimal Short-Circuit Resilient Formulas. In Computational Complexity Conference (CCC), Vol. 137. 10: 1-10 : 22.
4. T.-H. Hubert Chan , Zhibin Liang , Antigoni Polychroniadou , and Elaine Shi . 2020 . Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels . In Symposium on Discrete Algorithms (SODA). 2349-2365 . T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, and Elaine Shi. 2020. Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. In Symposium on Discrete Algorithms (SODA). 2349-2365.
5. Roland L'vovich Dobrushin and SI Ortyukov. 1977. Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements. Problemy Peredachi Informatsii 13 3 ( 1977 ) 56-76. Roland L'vovich Dobrushin and SI Ortyukov. 1977. Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements. Problemy Peredachi Informatsii 13 3 ( 1977 ) 56-76.