47 min
Locality in Codes and Computation | Richard M. Karp Distinguished Lecture
Computer Science and Mathematics seminar by Noga Ron-Zewi, University of Haifa
Hosted by Simons Institute for the Theory of Computing, UC Berkeley
Thursday 15:30 Los Angeles (GMT-7)
Recording available
Berkeley, United States
Recording
Abstract
Noga Ron-Zewi examines randomised algorithms that make decisions after inspecting only a small fraction of their input. The lecture traces connections between local error detection and correction, computational hardness and privacy-related applications, then discusses unresolved challenges in constructing local algorithms for error-correcting codes.
Topics
randomised algorithmslocal algorithmslocal error detectioncomputational hardnessprivacy-related applicationserror-correcting codeslocal algorithms for error-correcting codes
Related seminars
Introduction to Data Structures and Optimization for Fast Algorithms | Richard M. Karp Distinguished Lecture
Video · 1 h 9 min · Captions · Sep 5, 2023Aaron Sidford, Stanford University
More from Simons Institute for the Theory of Computing, UC Berkeley
All talksOptimal Spectral Gaps | Richard M. Karp Distinguished Lecture
Oct 14, 2026Ramon van HandelMy Favorite Expanders | Richard M. Karp Distinguished Lecture
Sep 29, 2026Ryan O'DonnellEncrypting to a Mathematical Fact | Theoretically Speaking
Video · 1 h 24 min · Captions · Jul 15, 2026Sanjam GargResponsibly Improving AI with Privacy-Sensitive Data: Principles, Theory, and Practice | Richard M. Karp Distinguished Lecture
Video · 1 h 10 min · Captions · Feb 24, 2026Brendan McMahan