Anton Bernshteyn Distributed Algorithms And Descriptive Combinatorics

Summary

ADGA 2021 — Workshop on Advances in This talk was part of the Workshop on "Set-Theory" held at the ESI July 4 to 8, 2022. In this talk we will investigate the interactions ... A celebrated theorem of Vizing says that every graph G of maximum degree Δ is (Δ+1)-edge-colorable. In this talk I will describe a ... University of South Carolina, Department of Mathematics Discrete Mathematics Seminar Date: October 22, 2021 Speaker: In 1995, Levin and Linial, London, and Rabinovich conjectured that every connected graph $G$ of polynomial growth admits an ... Motivated by the study of greedy 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) itcs-conf.org/ Local Problems on Trees from the ... Speaker: Dmitry Feichtner-Kozlov Date: Saturday, November 7 In the first half of the talk I will give a very compressed introduction ... Aalto University course CS-E4510 Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: ... Théories des groups mesurée/ Measured Group Theory (Mars/March 06-17, 2023) Mars/March 16: Webpage ...