Previous Conferences & Workshops

Sep
27
2022

Computer Science/Discrete Mathematics Seminar II

Robust Sublinear Expanders, and an Application Towards the Erdos-Gallai Conjecture
Matija Bucic
10:30am|Simonyi Hall 101 and Remote Access

Expander graphs have been perhaps one of the most widely useful classes of graphs ever considered. In this talk we will focus on a fairly weak notion of expanders called sublinear expanders, first introduced by Komlos and Szemeredi around 25 years...

Sep
26
2022

Computer Science/Discrete Mathematics Seminar I

Making Proofs More Constructive, and Algorithms Less Random
Oliver Korten
11:15am|Simonyi 101 and Remote Access

A central topic in the theory of computation is derandomization: say we have an algorithm which flips coins to achieve some goal, and succeeds with high probability. Can we transform this algorithm into a deterministic procedure, while maintaining...