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.

WOLA has been organized since 2016. Previous WOLA webpages can be found at: 2016, 2018, 2019, 2020, 2021.

The worshop is an integral part of Simons Semester.

When:  June 25th – 27th, 2022 
Where: The workshop will be held in hybrid mode: 

• in-person at BUW Aula (University of Warsaw Old Library) at Krakowskie Przedmieście 26/28 in Warsaw and
• at Zoom meeting

https://zoom.us/j/98206494746?pwd=Qy83V0VjdWJLT1lROHY5dVh6WG9SUT09

Meeting ID: 982 0649 4746

Passcode: 975518

Program Committee :

• Noga Alon (Princeton University)
• Robert Krauthgamer (Weizmann Institute of Science)
• Sepideh Mahabadi (Microsoft Research
• Krzysztof Onak (chair, Boston University)
• Noga Ron-Zewi (University of Haifa)
• Jukka Suomela (Aalto University)

Local organizers:

• Piotr Sankowski, IDEAS NCBR & University of Warsaw