About

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 these areas include sublinear-time algorithms, distributed 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. To this end, the workshop will feature a small number of longer talks that, in part, survey approaches by various communities, as well as short, focused talks on recent, exciting results. The first instantiation of the Workshop on Local Algorithms (WoLA) was held in Fall of 2016. Previous WOLA webpages can be found at: 2016, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025.

Workshop Location: 17th floor conference room in the CDS building at Boston University.

Program Committee:

• Maryam Aliakbarpour, Rice University
• Sepehr Assadi, University of Waterloo (Chair)
• Eric Blais, University of Waterloo
• Yi-Jun Chang, National University of Singapore
• Talya Eden, Bar Ilan University
• Nathan Harms, University of British Columbia
• Akash Kumar, ITT Bombay
• Yannic Maus, TU Graz
• Sofya Raskhodnikova, Boston University
• Chen Wang, Rensselaer Polytechnic Institute

Local Organizer: Sofya Raskhodnikova, Boston University

Steering Comittee: Clement Canonne, Jacob Fox, Mohsen Ghaffari, Oded Goldreich, Sanjeev Khanna, Dana Ron, and Ronitt Rubinfeld

Sponsors: Boston University

Contact Information: Joanne Hanley, joanne@csail.mit.edu

To subscribe to the WOLA mailing list please go to https://lists.csail.mit.edu/mailman/listinfo/wola/ and follow instructions or email joanne@csail.mit.edu.

Accessibility