Kozachinsky Alexander

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. 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