Sparsity and Privacy in Distributed Matrix Multiplication

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=lfu7TG2JV8Q


Duration: 27:18
52 views
3

Rawad Bitar (Technical University of Munich)
https://simons.berkeley.edu/talks/rawad-bitar-technical-university-munich-2024-03-08
Application-Driven Coding Theory



Other Videos By Simons Institute for the Theory of Computing


2024-04-15Local Minima in Quantum Systems
2024-04-15Oracle Separations Between QMA and QCMA
2024-04-15Classification of 2D Gapped Ground States With Strict Area Law
2024-04-15Introduction To Commuting Local Hamiltonian Problems
2024-04-15Quantum Complexity of Clique Homology
2024-04-15How Quantum Complexity Found Its Way into Black Hole Physics | Special Lecture
2024-04-04Private Information Retrieval: Chasing Capacity with Algebraic Codes
2024-04-04Data Deduplication For Redundant Graph Structures Files
2024-04-04High-Rate Fair-Density Parity-Check Codes
2024-04-04Graph Neural Networks for Classical and Quantum Channel Coding
2024-04-04Sparsity and Privacy in Distributed Matrix Multiplication
2024-04-04Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs
2024-04-04Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing
2024-04-04Approximate coding computing
2024-04-04Coded matrix computation: numerical stability, partial stragglers and sparse input matrices
2024-04-04Coding For Dna Storage With Nanopore Sequencing
2024-04-04Polar Codes For Ids Channels
2024-04-04Neural Distributed Source Coding
2024-04-04Quantized-Constraint Concatenation And The Covering Radius Of Constrained Systems
2024-04-04Cover Your Bases: How To Minimize The Sequencing Coverage In Dna Storage Systems
2024-04-04Maximally Recoverable Codes


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Application-Driven Coding Theory
Rawad Bitar