–
Lunch provided by Simons Institute
–
Information-theoretic perspectives on data movement for tensor operations

Grace Dinh (Cornell University)
–
Optimal Algorithms for Eigenvalue Problems and the SVD

Ryan Schneider (UC Berkeley)
–
Sketching twenty years later

Ethan Epperly (Caltech)
–
Matrix recovery and operator learning from sketches

Diana Halikias(New York University)
–
Break
–
Multiprocessor Computing: Theory Meets Practice

Naama Ben-David ( Technion)
–
Towards Theory-Guided Systems: Processing Near Memory and Learned Indexes

Hongbo Kang (Tsinghua University)
–
Fine-Grained Complexity and Algorithms via Algebraic and Combinatorial Tools

Ce Jin (UC Berkeley)
–
Tea Time
–
History Independence in Data Structures

Hanna Komlos (New York University)
–
Oblivious Reconfigurable Networks (and more!)

Tegan Wilson (Northeastern University)
–
Efficient and Scalable Parallel Graph Algorithms

Letong Wang (Simons Intitute)
–
Scheduling with Emerging Considerations

Varun Suriyanarayana (Cornell University)
–
Break
–
The Linear Heart of Algebraic Complexity

Dutta Pranjal (Nanyang Technological University (NTU) Singapore)
–
Old Tools, New Problems: Tensor Rank, Group Theory, and Expanders in Complexity

Kevin Pratt (New York University)
–
Border Rank Lower Bounds

Tomas Mańdziuk ( Texas A&M University)
–
Polynomials and Structured Linear Algebra

Robert Andrews (University of Waterloo)
–
Tea Time