This event brings together researchers in theoretical computer science, algorithms and optimization for a day of talks and discussions about recent trends in our fields.

Date: June 17 (Tuesday) 2025

Location: Bocconi University, Via Roentgen 1, AS01

Go towards the reception of the Roentgen building and then go down the stairs below the restaurant.

Registration:

The event is free of charge for participants, but registration is required. Please use the following link:

https://events.unibocconi.eu/index.php?key=ev2025050010

In case of any difficulties with registration, please contact Marek Elias or any other organizer.

Organizers:

• Andrea Celli
• Tommaso d'Orsi
• Marek Elias
• Adam Polak
• Laura Sanita

Speakers:

• Ioana Bercea (KTH)
• Marco Bressan (University of Milan)
• Siu On Chan (Bocconi)
• Daniel Dadush (CWI)
• Mika Göös (EPFL)
• Alexandros Hollender (Oxford)

Program

9:00—9:30 Registration

9:30—10:15 Mika Göös: Bracket Game

10:15—11:00 Siu On Chan: How Random CSPs Fool Hierarchies: I & II

Coffee break

11:30—12:15 Ioana Bercea: Locally Uniform Hashing

Lunch

14:00—14:45 Alexandros Hollender: Total Search Problems in Optimization

14:45—15:30 Marco Bressan: Of Dice and Games: A Theory of Generalized Boosting

Coffee break

16:00—16:45 Daniel Dadush: From Incremental Transitive Cover to Strongly Polynomial Maximum Flow