HIGHLIGHTS OF ALGORITHMS

Vrije Universiteit Amsterdam, June 4-6, 2018

Programme

All talks take place in the Auditorium, except where otherwise indicated (the parallel contributed talks sessions).

Monday, June 4


8:45 — 9:00 Welcome
9:00 — 10:00 Danupon Nanongkai — Dynamic algorithms and complexity
10:00 — 10:30 Aaron Bernstein — Online Bipartite Matching with Amortized O(log2 n) Replacements
10:30 — 11:00 Coffee break
11:00 — 11:30 Anindya De — Trace Reconstruction with exp(O(n1/3)) Samples + Optimal Mean-based Algorithms for Trace Reconstruction
11:30 — 12:00 Tselil Schramm — The Power of Sum-of-Squares for Detecting Hidden Structures
12:00 — 12:30 Uri Stemmer — Practical Locally Private Heavy Hitters
12:30 — 14:00 Lunch
14:00 — 15:30 Contributed talks 1 (parallel sessions)
15:30 — 16:00 Coffee break
16:00 — 17:00 Barna Saha — Fast approximate dynamic programming for edit problems
17:00 — 17:30 Sergio Cabello — Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
17:30 — 18:00 Amir Abboud — Distributed PCP Theorems for Hardness of Approximation in P
18:00 — 19:00 Poster session 1

Tuesday, June 5


9:00 — 10:00 Fabian Kuhn — LOCAL distributed algorithms
10:00 — 10:30 Seth Pettie — A Time Hierarchy Theorem for the LOCAL Model
10:30 — 11:00 Coffee break
11:00 — 12:00 Ankur Moitra — Algorithmic problems in robust statistics
12:00 — 12:30 Moses Charikar — A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics
12:30 — 14:00 Lunch
14:00 — 15:30 Contributed talks 2 (parallel sessions)
15:30 — 16:00 Coffee break
16:00 — 16:30 Vera Traub — Approaching 3/2 for the s-t-path TSP
16:30 — 17:00 Chandra Chekuri — Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
17:00 — 17:30 Parinya Chalermsook — From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
17:30 — 18:00 Pasin Manurangsi — Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
18:00 — 19:00 Poster session 2
19:00 — 20:00 Business meeting

Wednesday, June 6


9:00 — 9:30 Rotem Oshman — A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness
9:30 — 10:00 Krzysztof Nowicki — MST in O(1) Round of Congested Clique
10:00 — 10:30 Magnús Halldorsson — Universal Framework for Wireless Scheduling Problems
10:30 — 11:00 Coffee break
11:00 — 12:00 Jelani Nelson — Recent advances concerning the Johnson-Lindenstrauss lemma
12:00 — 12:30 Sanjeev Khanna — Randomized composable coresets for matching and vertex cover
12:30 — 14:00 Lunch
14:00 — 15:00 Timothy Chan — Geometric problems in moderate dimensions
15:00 — 15:30 Yuval Filmus — Twenty (Simple) Questions
15:30 — 16:00 Coffee break
16:00 — 16:30 Inbal Talgam-Cohen — Approximate modularity revisited
16:30 — 17:00 Jonathan Kelner — Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs
17:00 — 17:30 Nikhil Bansal — Faster Space-Efficient Algorithms for Subset Sum and k-Sum

Accepted contributed presentations