Sparsity and Privacy in Distributed Matrix Multiplication

Sparsity and Privacy in Distributed Matrix Multiplication

Explore the intersection of sparsity and privacy in distributed matrix multiplication through this insightful 27-minute talk by Rawad Bitar from the Technical University of Munich. Delve into the concepts of application-driven coding theory as part of the Simons Institute's series on advanced mathematical topics. Gain valuable insights into how sparsity affects privacy concerns in distributed computing environments and learn about potential solutions for maintaining data confidentiality while optimizing computational efficiency.