Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fundamentals of sketching algorithms in this hour-long lecture by Michael Kapralov from EPFL. Delve into the first part of a comprehensive overview on data structures and optimization techniques for fast algorithms. Learn about the core concepts and applications of sketching in computer science, with a focus on how these methods can be used to efficiently process and analyze large datasets. Gain insights into the theoretical foundations and practical implementations of sketching algorithms, and understand their role in modern algorithmic design. This talk, part of the Data Structures and Optimization for Fast Algorithms Boot Camp at the Simons Institute, provides a solid foundation for researchers and practitioners interested in advanced algorithmic techniques.