Organisers: Vadim Lozin, Tom Gur

The DIMAP Workshop 2019 is taking place at the Department of Computer Science and DIMAP, University of Warwick, May 31, 2019 -- Lecture Room CS1.04.

This event is by invitation only.

---

Programme

9:30 - 10:00: Gathering and opening remarks

10:00 - 10:15: Relaxed sunflower lemmas [Tom Gur]
10:15 - 10:30: Streaming algorithms for packing and scheduling problems [Pavel Vesely]
10:30 - 10:45: Small summaries for big data [Graham Cormode]

10:45 - 11:00: Coffee/tea break

11:00 - 11:15: Boundary properties of graphs [Vadim Lozin]
11:15 - 11:30: A new notion of dimension for graphs, groups, and metric spaces [Agelos Georgakopoulos]
11:30 - 11:45: Slow mixing and cut-off for spin-plaquette models [Paul Chleboun]
11:45 - 12:00: A new model for generalised random graphs [Lorenzo Federico]

12:00 - 13:00: Lunch (CS1.03)

13:00 - 13:15: Measurable versions of Vizing's theorem [Oleg Pikhurko]
13:15 - 13:30: Matrices, intersections, and computation [Igor Carboni Oliveira]
13:30 - 13:45: Graph functionality [Bogdan Alecu]

13:45 - 14:00: Coffee/tea break

14:00 - 15:00: Combinatorics seminar (MS.04)

15:15 - 15:30: The algebra of string comparison: computing with sticky braids [Alex Tiskin]
15:30 - 15:45: Complexity of verifying differential privacy in circuits [David Purser]
15:45 - 16:00: Group testing and beep communication [Peter Davies]

16:00 - 17:00: Research discussions

---

Confirmed participants

Bogdan Alecu, Dmitry Chistikov, Paul Chleboun, Graham Cormode, Sam Coy, Artur Czumaj, Jacques Dark, Peter Davies, Lorenzo Federico, Agelos Georgakopoulos, Tom Gur, Marcin Jurdzinski, Vadim Lozin, Igor Carboni Oliveira, David Purser, Oleg Pikhurko, Alex Tiskin, Pavel Vesely.