Local algorithms – that is, algorithms that compute and make decisions on parts of the output considering only a portion of the input – have been studied in a number of areas in theoretical computer science and mathematics. Some of the related areas include sublinear-time algorithms, distributed algorithms, streaming algorithms, (massively) parallel algorithms, inference in large networks, and graphical models. These communities have similar goals but a variety of approaches, techniques, and methods.
This workshop is aimed at fostering dialogue and cross-pollination of ideas between the various communities. The workshop will feature a small number of longer spotlight talks that, in part, survey approaches by various communities, as well as a poster session, focused on recent, exciting results.
The worshop is an integral part of Simons Semester.
When: June 25th – 27th, 2022
Where: The workshop will be held in hybrid mode:
Meeting ID: 982 0649 4746
Program Committee :
Piotr Sankowski, IDEAS NCBR & University of Warsaw