You are cordially invited to attend the TCS for All 2025 Meeting, taking place on June 27, 2025, from 9:45 AM to 10:45 AM in Prague, Czech Republic. This workshop is part of the 57th Symposium on Theory of Computing (STOC) and will feature a keynote talk by Prof. Sofya Raskhodnikova (Boston University). The event is open to all attendees.
Speaker and Talk Details:
2025 TCS for All Inspirational Talk by
Prof. Sofya Raskhodnikova (Boston University)
Title: Private Computation via Local Algorithms
Abstract: We will explore research areas at the intersection of local algorithms and differential privacy. We will highlight recent advances in local algorithms that enable black-box differentially private queries to sensitive datasets. We will also discuss distributed models of privacy, where each individual perturbs their own data locally—without trusting any centralized curator—so that the final output guarantees privacy even if the central server is compromised. I will sprinkle the talk with pieces of advice I found useful–and some that I learned to ignore.
Bio: Sofya Raskhodnikova is a Professor of Computer Science at Boston University. Her office is in the newly constructed Center for Computing and Data Sciences—colloquially known as the Jenga building. She received her S.B., S.M., and Ph.D. degrees from MIT, and held postdoctoral positions at the Hebrew University of Jerusalem and the Weizmann Institute of Science. Prior to joining BU, she was a Professor of Computer Science and Engineering at Penn State. She has also held visiting positions at the Institute for Pure and Applied Mathematics at UCLA, Boston University, Harvard University, and the Simons Institute for the Theory of Computing at Berkeley. Sofya’s research focuses on randomized and approximation algorithms, with a primary emphasis sublinear-time algorithms for combinatorial problems and data privacy.