Alexander Kozachinskiy

Orcid: 0000-0002-9956-9023

According to our database1, Alexander Kozachinskiy authored at least 27 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On dimensionality of feature vectors in MPNNs.
CoRR, 2024

Infinite Separation Between General and Chromatic Memory.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Energy Games over Totally Ordered Groups.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Continuous Positional Payoffs.
Log. Methods Comput. Sci., 2023

Towards Simpler Sorting Networks and Monotone Circuits for Majority.
Electron. Colloquium Comput. Complex., 2023

Logical Languages Accepted by Transformer Encoders with Hard Attention.
CoRR, 2023

Simple online learning with consistency oracle.
CoRR, 2023

Inapproximability of sufficient reasons for decision trees.
CoRR, 2023

Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Find a witness or shatter: the landscape of computable PAC learning.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Multiparty Karchmer-Wigderson Games and Threshold Circuits.
Theory Comput., 2022

Constant-Depth Sorting Networks.
Electron. Colloquium Comput. Complex., 2022

State Complexity of Chromatic Memory in Infinite-Duration Games.
CoRR, 2022

One-To-Two-Player Lifting for Mildly Growing Memory.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

New Bounds for the Flock-of-Birds Problem.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited.
J. Comput. Syst. Sci., 2021

Polyhedral Value Iteration for Discounted Games and Energy Games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Recognizing Read-Once Functions from Depth-Three Formulas.
Theory Comput. Syst., 2020

2019
Lower bounds on separation automata for Parity Games.
CoRR, 2019

Two Characterizations of Finite-State Dimension.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Raz-McKenzie simulation: new gadget and unimprovability of Thickness Lemma.
CoRR, 2018

From Expanders to Hitting Distributions and Simulation Theorems.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2016
One-sided error communication complexity of Gap Hamming Distance.
Electron. Colloquium Comput. Complex., 2016

2015
On Slepian-Wolf Theorem with Interaction.
Electron. Colloquium Comput. Complex., 2015

Some Bounds on Communication Complexity of Gap Hamming Distance.
CoRR, 2015

Making Randomness Public in Unbounded-Round Information Complexity.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
On the role of private coins in unbounded-round Information Complexity.
Electron. Colloquium Comput. Complex., 2014


  Loading...