Theory Seminar - On Linear Data Structures and Matrix Rigidity, Sivaramakrishnan Ramamoorthy
Offered By: Paul G. Allen School via YouTube
Course Description
Overview
Explore a theory seminar on linear data structures and matrix rigidity presented by Sivaramakrishnan Ramamoorthy from the University of Washington. Delve into the equivalence between systematic linear data structures and rectangular rigidity, examine rigidity lower bounds for rank one matrix vectors, and investigate a Cayley graph question related to linear data structures. Learn about upper bounds, algorithmic questions, redundancy, rigidity theorems, query sets, proofs, and open problems in this 55-minute lecture from the Paul G. Allen School, recorded on February 11, 2020 with closed captions available.
Syllabus
Introduction
Linear data structures
Upper bounds
Algorithmic questions
Redundancy
rigidity
theorem
query sets
proof
open problem
Taught by
Paul G. Allen School
Related Courses
Coding the Matrix: Linear Algebra through Computer Science ApplicationsBrown University via Coursera Mathematical Methods for Quantitative Finance
University of Washington via Coursera Introduction à la théorie de Galois
École normale supérieure via Coursera Linear Algebra - Foundations to Frontiers
The University of Texas at Austin via edX Massively Multivariable Open Online Calculus Course
Ohio State University via Coursera