Volgen
Alexander Kozachinskiy
Alexander Kozachinskiy
Postdoc, CENIA Chile
Geverifieerd e-mailadres voor cenia.cl
Titel
Geciteerd door
Geciteerd door
Jaar
Logical languages accepted by transformer encoders with hard attention
P Barceló, A Kozachinskiy, AW Lin, V Podolskii
arXiv preprint arXiv:2310.03817, 2023
132023
Three iterations of (d− 1)-WL test distinguish non isometric clouds of d-dimensional points
V Delle Rose, A Kozachinskiy, C Rojas, M Petrache, P Barceló
Advances in Neural Information Processing Systems 36, 9556-9573, 2023
112023
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
A Kozachinskiy, A Shen
Journal of Computer and System Sciences 118, 75-107, 2021
92021
Energy games over totally ordered groups
A Kozachinskiy
arXiv preprint arXiv:2205.04508, 2022
82022
One-to-two-player lifting for mildly growing memory
A Kozachinskiy
arXiv preprint arXiv:2104.13888, 2021
82021
Find a witness or shatter: the landscape of computable PAC learning.
V Delle Rose, A Kozachinskiy, C Rojas, T Steifer
The Thirty Sixth Annual Conference on Learning Theory, 511-524, 2023
72023
From expanders to hitting distributions and simulation theorems
A Kozachinskiy
arXiv preprint arXiv:1802.04014, 2018
6*2018
Recognizing read-once functions from depth-three formulas
A Kozachinskiy
Theory of Computing Systems 64, 3-16, 2020
52020
Two characterizations of finite-state dimension
A Kozachinskiy, A Shen
Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019
52019
On Slepian–Wolf Theorem with Interaction
A Kozachinskiy
Theory of Computing Systems 62, 583-599, 2018
52018
On dimensionality of feature vectors in MPNNs
CÊ Bravo, A Kozachinskiy, Cà Rojas
arXiv preprint arXiv:2402.03966, 2024
42024
Constant-depth sorting networks
N Dobrokhotova-Maikova, A Kozachinskiy, V Podolskii
arXiv preprint arXiv:2208.08394, 2022
42022
State complexity of chromatic memory in infinite-duration games
A Kozachinskiy
arXiv preprint arXiv:2201.09297, 2022
42022
Making randomness public in unbounded-round information complexity
A Kozachinskiy
Computer Science--Theory and Applications: 10th International Computer …, 2015
4*2015
Simple online learning with consistent oracle
A Kozachinskiy, T Steifer
arXiv preprint arXiv:2308.08055, 2023
32023
Polyhedral value iteration for discounted games and energy games
A Kozachinskiy
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
32021
Lower bounds on transformers with infinite precision
A Kozachinskiy
arXiv preprint arXiv:2412.20195, 2024
22024
Infinite separation between general and chromatic memory
A Kozachinskiy
Latin American Symposium on Theoretical Informatics, 114-128, 2024
22024
Continuous positional payoffs
A Kozachinskiy
Logical Methods in Computer Science 19, 2023
22023
Inapproximability of sufficient reasons for decision trees
A Kozachinskiy
arXiv preprint arXiv:2304.02781, 2023
22023
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20