ABCDEFGHIJKLMNOPQRSTUVWXYZAA
1
WOLA 2023: FINAL SCHEDULE
2
Room 32-G449 at MIT Stata Center
See the three other sheets in this document for abstracts of the talks and list of short talks
3
4
Monday, August 7
5
9:05Opening
6
9:10Spotlight talkAsaf Shapira (Tel Aviv University)Testing versus Estimation of Graph Properties, Revisited
7
10:05TalkMaryam Aliakbarpour (Rice University)Hypothesis Selection with Memory Constraints
8
10:35Coffee break
9
11:05Short talksAmir Azarmehr (Northeastern University), Lorenzo Beretta (Copenhagen University), Vihan Shah (Rutgers), Mehrdad Ghadiri (MIT), Harms Nathaniel Idein (EPFL), Dragos Ristache (Boston University), Kai Zhe Zheng (MIT), Ephraim Linder (Boston University), Renato Ferreira Pinto Jr (University of Waterloo), Hadley Black (UCLA), Uri Meir (Tel Aviv University), Abhishek Dhawan (Georgia Tech), John Lazarsfeld (Yale), Nadya Voronova (Boston University)
10
12:30Lunch break
11
14:30Spotlight talkSofya Raskhodnikova (Boston University)What Can Local Algorithms Do for Privacy?
12
15:35Coffee break
13
16:00Talks
Themis Gouleakis (National University of Singapore)
Active Causal Structure Learning with Advice
14
16:30Poster session
R&D Commons on the 4th floor of the Stata Center - just outside of room 32-G449
15
16
Tuesday, August 8
17
9:15Spotlight talkDeeparnab Chakrabarty (Dartmouth College)Parallel Submodular Function Minimization
18
10:10TalkGuy Even (Tel Aviv University)Dynamic Filter and Retrieval with One Memory Access
19
10:40Coffee break
20
11:10TalksCharilaos Efthymiou (University of Warwick)Spectral Independence Beyond Uniqueness
21
Yufei Zhao (MIT)Second Eigenvalue Multiplicity
22
12:10Lunch break (junior - senior lunch)
23
14:05Spotlight talkMagnús M. Halldórsson (Reykjavik University)Space-constrained Distributed Locality: The Case of Graph Coloring
24
15:00TalkAnton Bernshteyn (Georgie Tech)Descriptive Combinatorics
25
15:30Coffee break
26
16:00TalksTalya Eden (Bar Ilan University)Triangle Counting with Local Edge Differential Privacy
27
Omri Ben-Eliezer (MIT)Approximate Counting of Sequential Patterns
28
17:00
Open Problem Session
29
30
Wednesday, August 9
31
9:15Spotlight talkEric Blais (University of Waterloo)Testing Graph Properties with the Container Method
32
10:10TalkTal Wagner (Amazon AWS)Fast Private Kernel Density Estimation via Locality Sensitive Quantization
33
10:40Coffee break
34
11:10TalkAlexandr Andoni (Columbia University)Subquadratic Accurate Euclidean Spanners, with Applications
35
11:40
Panel: Future of Local Algorithms (panelists: Alex Andoni, Vladimir Braverman, Magnús M. Halldórsson, Piotr Indyk, Ronitt Rubinfeld)
36
12:30Lunch break
37
14:10Spotlight talkSanjeev Khanna (University of Pennsylvania)On Regularity Lemma and Barriers in Streaming and Dynamic Matching
38
15:05TalkRajesh Jayaram (Google Research NYC)Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
39
15:35Coffee break
40
16:05TalksHsin-Hao Su (Boston College)Matching and Clustering via Symmetry Breaking
41
Krzysztof Onak (Boston University)Maintaining Random Objects Against Adaptive Adversaries
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100