|
|
Список публикаций:
|
|
Цитирования (Crossref Cited-By Service + Math-Net.Ru) |
|
|
|
 2023 |
| 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.    ; |
|
| 2022 |
| 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  ; |
| 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 ; |
| 4. |
Alexander Kozachinskiy, Energy Games over Totally Ordered Groups, 2022 , 12 pp., arXiv: 2205.04508 |
| 5. |
Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii, Constant-Depth Sorting Networks, 2022 , 17 pp., arXiv: 2208.08394 |
| 6. |
Alexander Kozachinskiy, Vladimir Podolskii, “Multiparty Karchmer–Wigderson games and threshold circuits”, Theory Comput., 18 (2022), 15 , 33 pp.  ; |
|
| 2020 |
| 7. |
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. ; |
|
Обратная связь: