47 min
Seminar, Hosted by Simons Institute for the Theory of Computing, UC Berkeley
Locality in Codes and Computation | Richard M. Karp Distinguished Lecture
University of Haifa
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 algorithms, broader topic: algorithms
- local algorithms, broader topic: algorithms
- local error detection, search World Wide
- computational hardness, search World Wide
- privacy-related applications, search World Wide
- error-correcting codes, search World Wide
- local algorithms for error-correcting codes, search World Wide