Monday September 8, 2014 |
||||
TIME |
ACTIVITIES |
VENUE |
||
08:15-09:00 |
Registration |
Lobby of Room 1-312, FIT Building |
||
09:00-09:10 |
Opening Remarks |
Room 1-312, FIT Building |
||
09:10-10:10 |
Keynote Talk 1 |
New Facets of the Random-Facet Algorithm |
||
10:10-10:40 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
10:40-11:15 |
Chair: |
Fully Dynamic Maximal Matching in O(log n) Update Time |
Room 1-312, FIT Building |
|
11:15-11:50 |
Faster LP Algorithm and Faster Maxflow Algorithm |
|||
12:00-14:00 |
Lunch (Lunch is on your own) |
|
||
14:00-14:35 |
Chair: |
Online Learning & Manipulation-proof Reputation Systems |
Room 1-312, FIT Building |
|
14:35-15:10 |
The Secretary Returns |
|||
15:10-15:40 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
15:40-16:15 |
|
Distributed Algorithms for the Lovász Local Lemma and Graph Coloring |
Room 1-312, FIT Building |
|
16:15-16:50 |
Algorithms and Generalizations for the Lovasz Local Lemma |
|||
Tuesday September 9, 2014 |
||||
TIME |
ACTIVITIES |
VENUE |
||
09:00-10:00 |
Keynote Talk 2 |
Towards Instance Optimal Property Testing |
Room 1-312, FIT Building |
|
10:00-10:30 |
Group Photo + Coffee Break |
Photo at the lobby of FIT Building |
||
10:30-11:05 |
Chair: |
Complexity of Approximating CSP with Balance / Hard Constraints |
Room 1-312, FIT Building |
|
11:05-11:40 |
The Complexity of Optimal Multidimensional Pricing |
|||
12:00-14:00 |
Lunch |
|
||
14:00-14:35 |
Chair: |
Sum of Squares Lower Bounds for Planted Clique |
Room 1-312, FIT Building |
|
14:35-15:10 |
Open Problems in Communication Complexity |
|||
15:10-15:40 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
15:40-16:15 |
Chair: |
Optimal Detection of Intersections between Convex Polyhedra |
Room 1-312, FIT Building |
|
16:15-16:50 |
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams |
|||
18:00-20:00 |
Reception (Buffet Dinner) |
Immperial Ballroom, Holiday Inn |
||
Wednesday September 10, 2014 |
||||
TIME |
ACTIVITIES |
VENUE |
||
9:00-10:00 |
Keynote Talk 3 |
Communication Complexity Theory: Thirty-Five Years of Set Disjointness |
Room 1-312, FIT Building |
|
10:00-10:30 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
10:30-11:05 |
Chair: |
Algebraic P vs NP and Chasms in the Arithmetic World |
Room 1-312, FIT Building |
|
11:05-11:40 |
Exponential Lower Bounds for Homogeneous Depth 4 Arithmetic Circuits |
|||
12:00-14:00 |
Lunch |
|
||
14:00-14:35 |
Chair: |
Nested Quantum Walks |
Room 1-312, FIT Building |
|
14:35-15:10 |
Lower Bounds in Quantum Property Testing |
|||
15:10-15:40 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
15:40-16:15 |
Chair: |
Streaming Cryptography |
Room 1-312, FIT Building |
|
16:15-16:50 |
The Security of Multiple Encryption in the Ideal Cipher Model |
|||
Thursday September 11, 2014 |
||||
TIME |
ACTIVITIES |
VENUE |
||
9:00-10:00 |
Keynote Talk 4 Chair: |
Representing Utilities at the Market |
Room 1-312, FIT Building |
|
10:00-10:30 |
Coffee Break |
Lobby of Room 1-312, FIT Building |
||
10:30-11:05 |
Chair: |
Siegel’s Theorem, Edge Coloring, and A Holant Dichotomy |
Room 1-312, FIT Building |
|
11:05-11:40 |
The Multi-shop Ski Rental Problem |
|||
12:00-14:00 |
Lunch |
|
||
14:00-14:35 |
Chair: |
Small Value Parallel Repetition for General Games |
Room 1-312, FIT Building |
|
14:35-15:10 |
Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems |
|||
15:10-15:45 |
Computing with A Full Memory: Catalytic Space |
|
||
15:45-16:00 |
Closing Ceremony |
|