« CoSP Workshop and School on Algorithms and Complexity
July 15, 2019 - July 16, 2019
Location:
Hill Center, Room 116
Rutgers University
Organizer(s):
Michal Koucký, Charles University
Martin Loebl, Charles University
The workshop will bring together students and researchers working in algorithms, computational complexity, and combinatorics. It will consist of four tutorials on recent advances in those fields in mornings and will allow for work in smaller groups in the afternoon.
The tutorial speakers are:
Each day will include two tutorial talks in the morning, with unstructured discussion time in the afternoons.
Monday, July 15, 2019
Registration and Breakfast
The Minimum Circuit Size Problem: What is it? And Why Do We Care?
Eric Allender, Rutgers University
Break
Alexandr Andoni, Columbia University
Lunch
Open Problem Session
Tuesday, July 16, 2019
Registration and Breakfast
How Well can Simple Dynamic Programs be Approximated?
Mike Saks, Rutgers University
Break
Coloring Graphs with a Forbidden Induced Subgraph
Sophie Spirkl, Rutgers University
Open Problem Session
The workshop is open to all interested participants. If you would like to participate, please send email to the organizers Michal Koucky (koucky@iuuk.mff.cuni.cz) or Martin Loebl (loebl@kam.mff.cuni.cz) to reserve your place.
The workshop is sponsored by the Combinatorial Structures and Processes Research and Innovation Staff Exchange project, which is funded by the European Union’s Horizon 2020 research and innovation programme. Grant information: H2020-MSCA-RISE-2018 project no. 823748 - CoSP
Please Note: If you are arriving by car, you must go here to arrange your parking permit:
https://rudots.nupark.com/events/Events/Register/01e57563-83dd-4cd0-abf6-d504c2a02fcc
Sponsored by Combinatorial Structures and Processes Research and Innovation Staff Exchange project and DIMACS, in association with the Research Experiences for Undergraduates (REU) Program and the Special Focus on Lower Bounds in Computational Complexity.