| 2025 | AAAI | Optimal Bounds for Dissatisfaction in Perpetual Voting. | Alexander Kozachinskiy, Alexander Shen, Tomasz Steifer |
| 2025 | ALT | Effective Littlestone dimension. | Valentino Delle Rose, Alexander Kozachinskiy, Tomasz Steifer |
| 2025 | ICML | Ehrenfeucht-Haussler Rank and Chain of Thought. | Pablo Barcel, Alexander Kozachinskiy, Tomasz Steifer |
| 2024 | COLT | Simple online learning with consistent oracle. | Alexander Kozachinskiy, Tomasz Steifer |
| 2024 | CSL | Energy Games over Totally Ordered Groups. | Alexander Kozachinskiy |
| 2024 | ICLR | Logical Languages Accepted by Transformer Encoders with Hard Attention. | Pablo Barcel, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii |
| 2024 | ICML | On dimensionality of feature vectors in MPNNs. | Csar Bravo, Alexander Kozachinskiy, Cristobal Rojas |
| 2024 | LATIN | Infinite Separation Between General and Chromatic Memory. | Alexander Kozachinskiy |
| 2023 | COLT | Find a witness or shatter: the landscape of computable PAC learning. | Valentino Delle Rose, Alexander Kozachinskiy, Cristbal Rojas, Tomasz Steifer |
| 2022 | CSR | New Bounds for the Flock-of-Birds Problem. | Alexander Kozachinskiy |
| 2022 | STACS | One-To-Two-Player Lifting for Mildly Growing Memory. | Alexander Kozachinskiy |
| 2021 | CONCUR | Continuous Positional Payoffs. | Alexander Kozachinskiy |
| 2021 | SODA | Polyhedral Value Iteration for Discounted Games and Energy Games. | Alexander Kozachinskiy |
| 2019 | FCT | Two Characterizations of Finite-State Dimension. | Alexander Kozachinskiy, Alexander Shen |
| 2018 | CSR | Recognizing Read-Once Functions from Depth-Three Formulas. | Alexander Kozachinskiy |
| 2018 | MFCS | One-Sided Error Communication Complexity of Gap Hamming Distance. | Egor Klenin, Alexander Kozachinskiy |
| 2018 | MFCS | From Expanders to Hitting Distributions and Simulation Theorems. | Alexander Kozachinskiy |
| 2016 | CSR | On Slepian-Wolf Theorem with Interaction. | Alexander Kozachinskiy |
| 2015 | CSR | Making Randomness Public in Unbounded-Round Information Complexity. | Alexander Kozachinskiy |