Day 1 | Friday, October 14
| Time | Session | Speaker |
|---|---|---|
|
8:30–9:00
|
Registration and Breakfast | |
|
9:00–9:10
|
Opening remarks | Ronitt Rubinfeld |
|
9:10–9:50
|
The power of locality for network algorithms | Christian Borgs |
|
9:50–10:10
|
Latent Space Model (aka Blind Regression) | Devavrat Shah |
|
10:10–10:30
|
Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods | Asu Ozdaglar |
|
10:30–10:50
|
Break | |
|
10:50–11:30
|
A short (and partial) survey on Partition Oracles | Dana Ron |
|
11:30–11:50
|
Local Computation Algorithms for High Degree Graphs | Shai Vardi |
|
11:50–12:10
|
Testing Graph Properties with a Polynomial Query Complexity | Asaf Shapira |
|
12:10–12:30
|
A Local Algorithm for Constructing Spanners in Minor-Free Graphs | Reut Levi |
|
12:30–2:10
|
Lunch | |
|
2:10–2:50
|
Local to global amplification: the block model vignette | Emmanuel Abbe |
|
2:50–3:10
|
On Limits of Local Algorithms for Solving Random Constraint Satisfaction Problems | David Gamarnik |
|
3:10–3:30
|
Locality in Coding Theory | Madhu Sudan |
|
3:30–3:50
|
Local algorithms, message passing and the hidden clique problem | Yash Deshpande |
|
3:50–4:20
|
Break
|
|
|
4:20–5:00
|
A few perspectives on local algorithms for sparse graphs | Elchanan Mossel |
|
5:00–5:20
|
Sublinear Time Algorithms via Optimization | Zheyuan Allen-Zhu |
|
5:20–5:40
|
An Optimization Approach to Local Graph Partitioning | Lorenzo Orrecchia |
|
5:40–6:00
|
Erasure-Resilient Property Testing | Sofya Raskhodnikova |
Day 2 | Saturday, October 15
| Time | Session | Speaker |
|---|---|---|
|
8:30–9:00
|
Registration and Breakfast | |
|
9:00–9:40
|
Improved Distributed Local Graph Algorithms | Mohsen Ghaffari |
|
9:40–10:00
|
Non-Local Probes Do Not Help with Many Graph Problems
|
Moti Medina |
|
10:00–10:20
|
Local Conflict Coloring
|
Pierre Fraigniaud |
|
10:20–10:40
|
Designing Local Algorithms with Algorithms
|
Jukka Suomela |
|
10:40–11:10
|
Break | |
|
11:10–11:30
|
Random walks approach in property testing
|
Artur Czumaj |
|
11:30–11:50
|
Approximating the Spectrum of a Graph | Christian Sohler |
|
11:50–12:20
|
Poster session | |
|
12:20–2:00
|
Lunch + poster session contd
|
|
|
2:00–2:20
|
Fast Constrained Submodular Maximization
|
Amin Karbasi |
|
2:20–2:40
|
Sublinear Random-Access Generators for Preferential Attachement Graphs
|
Adi Rosen |
|
2:40–3:00
|
Robust Learning and the Semi-Verified Model
|
Greg Valiant |
|
3:00–3:20
|
Heavy hitters via cluster-preserving clustering
|
Huy L. Nguyen |
|
3:20–3:40
|
Slow inconsistent statistics | Jason Morten |
|
3:40–4:10
|
Break | |
|
4:10–4:30
|
Testing K-Monotonicity | Elena Grigorescu |
|
4:30–4:50
|
HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs | Kevin Matulef |
|
4:50–5:10
|
Computing with Unknown Noise Rate | Jared Saia |
|
5:10–5:30
|
Concurrent Disjoint Set Union | Robert Tarjan |
|
5:30–5:50
|
Locality and Parallelism | Krzysztof Onak |