Friday, April 17, 2020
2:00 PM -
3:30 PM
Online Event
Caltech/UCLA Logic Seminar
Descriptive combinatorics and distributed algorithms
Descriptive combinatorics is the study of combinatorial problems (such as graph coloring) under additional topological or measure-theoretic regularity restrictions. It turns out that there is a close relationship between descriptive combinatorics and distributed computing, i.e., the area of computer science concerned with problems that can be solved efficiently by a decentralized network of processors. In this talk I will outline this relationship and present a number of applications.
Event Sponsors:
For more information, please contact Math Department by phone at 626-395-4335 or by email at [email protected].