Current Trends in Theoretical Computer Science Seminar
This seminar is aimed at students that are interested in the current advances in the landscape of theoretical computer science and insights into new research. The main part of this seminar will consist of reading and discussing recent papers with interesting and new results, where every participant will once lead the discussion on the given topic.
There will be a Kickoff Meeting on Friday the 4th of July at 15:00 in 50.34 -119 to discuss organizational matters, topics and dates.
The seminar is organized to take place as several blocks over the course of August and September.
Dates
| Block | Datum | Zeit | Thema |
|---|---|---|---|
| 1 | 19. August | 09:45 - 11:15 | Introduction to Additive Combinatorics |
| 11:30 - 13:00 | Behrend's Construction and Sum-free Sets | ||
| 20. August | 09:45 - 11:15 | The BSG Theorem and its application to clustered 3-SUM | |
| 11:30 - 13:00 | Kneser's Theorem and Boolean Convolution | ||
| 2 | 1. September | 09:45 - 11:15 | Beating Bellman's Algorithm for Subset Sum |
| 11:30 - 13:00 | Small Doubling Constants and Algorithms on Integer Sets | ||
| 2. September | 09:45 - 11:15 | The Hypergraph Container Method | |
| 11:30 - 13:00 | Algorithmic Applications of the Hypergraph Container Method | ||
| 3 | 22. September | 09:45 - 11:15 | Counting k-SAT formulas |
| 11:30 - 13:00 | Regular Hypergraphs using Combinatorial Block Designs | ||
| 23. September | 09:45 - 11:15 | Prefix Covering Designs and Klees Measurement Problem | |
| 11:30 - 13:00 | The Sparsification Lemma |
The seminar is planned to take place in 50.34 Room -119.
If you are interested, please register with us per e-mail: julian.stiess@kit.edu