History Independence, Matrix Recovery, Byzantine Agreement, Oblivious Networks, and Euclidean Algorithm Complexity - Lightning Talks

Watch a series of lightning talks by Simons Institute Fellows covering cutting-edge research in theoretical computer science and mathematics. Explore five distinct research presentations including history independence in data structures by Hanna Komlós, data-efficient matrix recovery and operator learning by Diana Halikias, Byzantine agreement with predictions by Naama Ben-David, optimal oblivious reconfigurable networks by Tegan Wilson, and complexity analysis of the Euclidean algorithm by Robert Andrews. Gain insights into advanced topics spanning data structure design, machine learning optimization, distributed computing protocols, network architecture, and algorithmic complexity theory. Learn about the latest developments in these fields from emerging researchers presenting their work at the Eleventh Annual Industry Day event hosted by the Simons Institute.