Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kozachinsky, Alexander

Statistics
in MathSciNet: 4 (4)
in Web of Science: 1 (1)
in Scopus: 3 (3)
Candidate of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person75325
https://scholar.google.com/citations?user=gAKBJ7kAAAAJ&hl=en
https://orcid.org/0000-0002-9956-9023
https://www.webofscience.com/wos/author/record/U-6461-2017
https://www.scopus.com/authid/detail.url?authorId=57006670000

List of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)

Articles

1. Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii, “Constant-Depth Sorting Networks”, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Leibniz Internat. Proc. in Inform., 251, 2023, 43 , 19 pp.  mathnet  crossref  mathscinet
2. Alexander Kozachinskiy, “One-To-Two-Player Lifting for Mildly Growing Memory”, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz Internat. Proc. in Inform., 219, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, 43:1–43:21 , arXiv: 2104.13888  mathnet  crossref  mathscinet  scopus
3. Alexander Kozachinskiy, “New Bounds for the Flock-of-Birds Problem”, International Computer Science Symposium in Russia, CSR 2022: Computer Science – Theory and Applications, Virtual Event, June 29 – July 1, 2022, Lecture Notes in Comput. Sci., 13296, Springer, Cham, 2022, 224–237  mathnet  crossref  mathscinet  scopus
4. Alexander Kozachinskiy, Vladimir Podolskii, “Multiparty Karchmer–Wigderson games and threshold circuits”, Theory Comput., 18 (2022), 15 , 33 pp.  mathnet  crossref  mathscinet  isi
5. Alexander Kozachinskiy, Vladimir Podolski, “Multiparty Karchmer – Wigderson Games and Threshold Circuits”, 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany, Leibniz Internat. Proc. in Inform., 169, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, 24 , 23 pp.  mathnet  crossref  scopus

ArXiv

6. Alexander Kozachinskiy, Energy Games over Totally Ordered Groups, 2022 , 12 pp., arXiv: 2205.04508
7. Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii, Constant-Depth Sorting Networks, 2022 , 17 pp., arXiv: 2208.08394; ;

Presentations in Math-Net.Ru
1. Population protocols and Presburger arithmetic
A. Kozachinsky
Seminars "Proof Theory" and "Logic Online Seminar"
April 11, 2022 18:30   
2. Информационная и коммуникационная сложность: общий и приватные источники случайности
N. K. Vereshchagin, A. Kozachinsky
Kolmogorov seminar on computational complexity and descriptive complexity
March 17, 2014 16:45
3. Linear lower bound for randomized communication complexity of disjointness (the proof by Braverman)
A. Kozachinsky
Kolmogorov seminar on computational complexity and descriptive complexity
December 9, 2013 16:45

Organisations