| From expanders to hitting distributions and simulation theorems A Kozachinskiy arXiv preprint arXiv:1802.04014, 2018 | 6* | 2018 |
| One-to-two-player lifting for mildly growing memory A Kozachinskiy arXiv preprint arXiv:2104.13888, 2021 | 5 | 2021 |
| On Slepian–Wolf theorem with interaction A Kozachinskiy Computer Science–Theory and Applications: 11th International Computer …, 2016 | 5 | 2016 |
| Automatic Kolmogorov complexity, normality, and finite-state dimension revisited A Kozachinskiy, A Shen Journal of Computer and System Sciences 118, 75-107, 2021 | 4 | 2021 |
| Recognizing read-once functions from depth-three formulas A Kozachinskiy Theory of Computing Systems 64, 3-16, 2020 | 4 | 2020 |
| Two characterizations of finite-state dimension A Kozachinskiy, A Shen Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019 | 4 | 2019 |
| Making randomness public in unbounded-round information complexity A Kozachinskiy Computer Science--Theory and Applications: 10th International Computer …, 2015 | 4* | 2015 |
| Energy Games over Totally Ordered Groups A Kozachinskiy arXiv preprint arXiv:2205.04508, 2022 | 3 | 2022 |
| State Complexity of Chromatic Memory in Infinite-Duration Games A Kozachinskiy arXiv preprint arXiv:2201.09297, 2022 | 3 | 2022 |
| Continuous positional payoffs A Kozachinskiy arXiv preprint arXiv:2012.09047, 2020 | 2 | 2020 |
| An application of communication complexity, Kolmogorov complexity and extremal combinatorics to parity games A Kozachinskiy, M Vyalyi arXiv preprint arXiv:1902.07175, 2019 | 2 | 2019 |
| One-sided error communication complexity of Gap Hamming Distance E Klenin, A Kozachinskiy 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 2 | 2018 |
| Polyhedral value iteration for discounted games and energy games A Kozachinskiy Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 1 | 2021 |
| Multiparty Karchmer-Wigderson games and threshold circuits A Kozachinskiy, V Podolskii arXiv preprint arXiv:2002.07444, 2020 | 1 | 2020 |
| Some bounds on communication complexity of gap hamming distance A Kozachinskiy arXiv preprint arXiv:1511.08854, 2015 | 1 | 2015 |
| Inapproximability of sufficient reasons for decision trees A Kozachinskiy arXiv preprint arXiv:2304.02781, 2023 | | 2023 |
| Constant-Depth Sorting Networks N Dobrokhotova-Maikova, A Kozachinskiy, V Podolskii arXiv preprint arXiv:2208.08394, 2022 | | 2022 |
| Infinite Separation between General and Chromatic Memory A Kozachinskiy arXiv preprint arXiv:2208.02691, 2022 | | 2022 |
| New Bounds for the Flock-of-Birds Problem A Kozachinskiy Computer Science–Theory and Applications: 17th International Computer …, 2022 | | 2022 |
| Uniform cross--intersecting families: proving Hirschorn's conjecture up to polynomial factor GP Bulgakov, A Kozachinskiy, MN Vyalyi arXiv preprint arXiv:2102.10277, 2021 | | 2021 |
alexander shenDirecteur de recherche 2 cl., LIRMM, CNRS, University of Montpellier 2, FranceVerified email at lirmm.fr
