default search action
Alexander Kozachinskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii
:
Towards Simpler Sorting Networks and Monotone Circuits for Majority. APPROX/RANDOM 2024: 50:1-50:18 - [c19]Alexander Kozachinskiy, Tomasz Steifer:
Simple online learning with consistent oracle. COLT 2024: 3241-3256 - [c18]Alexander Kozachinskiy:
Energy Games over Totally Ordered Groups. CSL 2024: 34:1-34:12 - [c17]Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii:
Logical Languages Accepted by Transformer Encoders with Hard Attention. ICLR 2024 - [c16]César Bravo, Alexander Kozachinskiy, Cristobal Rojas:
On dimensionality of feature vectors in MPNNs. ICML 2024 - [c15]Alexander Kozachinskiy
Infinite Separation Between General and Chromatic Memory. LATIN (2) 2024: 114-128 - [i27]César Bravo, Alexander Kozachinskiy, Cristóbal Rojas:
On dimensionality of feature vectors in MPNNs. CoRR abs/2402.03966 (2024) - 2023
- [j5]Alexander Kozachinskiy:
Continuous Positional Payoffs. Log. Methods Comput. Sci. 19(3) (2023) - [c14]Valentino Delle Rose, Alexander Kozachinskiy, Cristóbal Rojas, Tomasz Steifer:
Find a witness or shatter: the landscape of computable PAC learning. COLT 2023: 511-524 - [c13]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Constant-Depth Sorting Networks. ITCS 2023: 43:1-43:19 - [c12]Valentino Delle Rose, Alexander Kozachinskiy, Cristobal Rojas, Mircea Petrache, Pablo Barceló:
Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points. NeurIPS 2023 - [i26]Valentino Delle Rose
Find a witness or shatter: the landscape of computable PAC learning. CoRR abs/2302.04731 (2023) - [i25]Valentino Delle Rose
Three iterations of (d-1)-WL test distinguish non isometric clouds of d-dimensional points. CoRR abs/2303.12853 (2023) - [i24]Alexander Kozachinskiy:
Inapproximability of sufficient reasons for decision trees. CoRR abs/2304.02781 (2023) - [i23]Alexander Kozachinskiy, Tomasz Steifer:
Simple online learning with consistency oracle. CoRR abs/2308.08055 (2023) - [i22]Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii:
Logical Languages Accepted by Transformer Encoders with Hard Attention. CoRR abs/2310.03817 (2023) - [i21]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Towards Simpler Sorting Networks and Monotone Circuits for Majority. CoRR abs/2310.12270 (2023) - [i20]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Towards Simpler Sorting Networks and Monotone Circuits for Majority. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]Alexander Kozachinskiy, Vladimir V. Podolskii:
Multiparty Karchmer-Wigderson Games and Threshold Circuits. Adv. Math. Commun. 18: 1-33 (2022) - [c11]Alexander Kozachinskiy
New Bounds for the Flock-of-Birds Problem. CSR 2022: 224-237 - [c10]Alexander Kozachinskiy:
One-To-Two-Player Lifting for Mildly Growing Memory. STACS 2022: 43:1-43:21 - [i19]Alexander Kozachinskiy:
State Complexity of Chromatic Memory in Infinite-Duration Games. CoRR abs/2201.09297 (2022) - [i18]Alexander Kozachinskiy:
Energy Games over Totally Ordered Groups. CoRR abs/2205.04508 (2022) - [i17]Alexander Kozachinskiy:
Infinite Separation between General and Chromatic Memory. CoRR abs/2208.02691 (2022) - [i16]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Constant-Depth Sorting Networks. CoRR abs/2208.08394 (2022) - [i15]Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Constant-Depth Sorting Networks. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j3]Alexander Kozachinskiy, Alexander Shen:
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited. J. Comput. Syst. Sci. 118: 75-107 (2021) - [c9]Alexander Kozachinskiy:
Continuous Positional Payoffs. CONCUR 2021: 10:1-10:17 - [c8]Alexander Kozachinskiy:
Polyhedral Value Iteration for Discounted Games and Energy Games. SODA 2021: 600-616 - [i14]Alexander Kozachinskiy:
One-to-Two-Player Lifting for Mildly Growing Memory. CoRR abs/2104.13888 (2021) - [i13]Alexander Kozachinskiy:
New Bounds for the Flock-of-Birds Problem. CoRR abs/2110.12452 (2021) - 2020
- [j2]Alexander Kozachinskiy
Recognizing Read-Once Functions from Depth-Three Formulas. Theory Comput. Syst. 64(1): 3-16 (2020) - [c7]Alexander Kozachinskiy
Multiparty Karchmer - Wigderson Games and Threshold Circuits. CCC 2020: 24:1-24:23 - [i12]Alexander Kozachinskiy, Vladimir V. Podolskii:
Multiparty Karchmer-Wigderson Games and Threshold Circuits. CoRR abs/2002.07444 (2020) - [i11]Alexander Kozachinskiy:
Polyhedral value iteration for discounted games and energy games. CoRR abs/2007.08575 (2020) - [i10]Alexander Kozachinskiy:
Continuous Positional Payoffs. CoRR abs/2012.09047 (2020) - [i9]Alexander Kozachinskiy, Vladimir V. Podolskii:
Multiparty Karchmer-Wigderson Games and Threshold Circuits. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c6]Alexander Kozachinskiy
Two Characterizations of Finite-State Dimension. FCT 2019: 80-94 - [i8]Alexander Kozachinskiy, Mikhail Vyalyi:
Lower bounds on separation automata for Parity Games. CoRR abs/1902.07175 (2019) - 2018
- [j1]Alexander Kozachinskiy
On Slepian-Wolf Theorem with Interaction. Theory Comput. Syst. 62(3): 583-599 (2018) - [c5]Alexander Kozachinskiy
Recognizing Read-Once Functions from Depth-Three Formulas. CSR 2018: 232-243 - [c4]Alexander Kozachinskiy:
From Expanders to Hitting Distributions and Simulation Theorems. MFCS 2018: 4:1-4:15 - [c3]Egor Klenin, Alexander Kozachinskiy:
One-Sided Error Communication Complexity of Gap Hamming Distance. MFCS 2018: 7:1-7:15 - [i7]Alexander Kozachinskiy:
Recognizing Read-Once Functions from Depth-Three Formulas. CoRR abs/1802.03815 (2018) - [i6]Alexander Kozachinskiy:
Raz-McKenzie simulation: new gadget and unimprovability of Thickness Lemma. CoRR abs/1802.04014 (2018) - 2016
- [c2]Alexander Kozachinskiy:
On Slepian-Wolf Theorem with Interaction. CSR 2016: 207-222 - [i5]Egor Klenin, Alexander Kozachinsky:
One-sided error communication complexity of Gap Hamming Distance. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Alexander Kozachinskiy:
Making Randomness Public in Unbounded-Round Information Complexity. CSR 2015: 296-309 - [i4]Alexander Kozachinskiy:
On Slepian-Wolf Theorem with Interaction. CoRR abs/1506.00617 (2015) - [i3]Alexander Kozachinskiy:
Some Bounds on Communication Complexity of Gap Hamming Distance. CoRR abs/1511.08854 (2015) - [i2]Alexander Kozachinsky:
On Slepian-Wolf Theorem with Interaction. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i1]Alexander Kozachinsky:
On the role of private coins in unbounded-round Information Complexity. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: