Expander Graphs Courses and Certifications

Institute for Advanced Study

Sparse Matrices in Sparse Analysis - Anna Gilbert

Explore sparse matrices in compressive sensing, focusing on expander graphs and their applications. Learn about metric repair scenarios and algorithms for sparse signal recovery.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.

• YouTube
• 23 minutes
• On-Demand
• Free Online Course

IEEE

Expander Graphs - Both Local and Global

Explore expander graphs, their local and global properties, construction methods, and applications in this concise IEEE talk by experts in the field.

• YouTube
• 21 minutes
• On-Demand
• Conference Talk

Hausdorff Center for Mathematics

High Dimensional Expanders

Explore high-dimensional expanders, their mathematical properties, and applications in theoretical computer science. Learn about coboundary and spectral expansion, and their implications for complex structures.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Online Course

USENIX

DistCache - Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching

Innovative distributed caching mechanism providing provable load balancing for large-scale storage systems. Partitions hot objects and adaptively routes queries, enabling linear cache throughput increase with node count.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

USENIX

Understanding Lifecycle Management Complexity of Datacenter Topologies

Explores lifecycle management complexity of datacenter topologies, comparing Clos and expander graphs. Introduces FatClique, a new topology combining wiring simplicity and expandability, with insights on deployment and expansion costs.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

USENIX

Flattened Clos - Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction

Innovative approach to designing high-performance, deadlock-free expander data center networks using graph contraction, offering improved efficiency and throughput compared to traditional Clos networks.

• YouTube
• 17 minutes
• On-Demand
• Conference Talk

Ryan O'Donnell

Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit

Explore Dinur's PCP Theorem proof, covering degree-reduction, expanderizing, and alphabet-reduction in theoretical computer science. Gain insights into advanced concepts for research in computational complexity.

• YouTube
• 26 minutes
• On-Demand
• Free Online Course

USENIX

Expanding Across Time to Deliver Bandwidth Efficiency and Low Latency

Innovative network design for datacenters combining low-latency delivery and high-bandwidth efficiency through dynamic reconfiguration, outperforming static topologies for various workloads.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

International Centre for Theoretical Sciences

Non-virtually Abelian Discontinuous Group Actions vs Proper SL(2,R)-Actions - Aleksy Tralle

Explore non-virtually Abelian discontinuous group actions and proper SL(2,R)-actions in this advanced mathematics lecture, part of a program on Zariski dense subgroups and geometric applications.

• YouTube
• 47 minutes
• On-Demand
• Free Online Course

Graph Partitioning and Expanders

Explore graph partitioning, expanders, and random walks in this advanced course. Learn spectral graph theory, analyze algorithms, and study pseudorandomness properties with applications in cryptography and coding theory.

• NovoEd
• 15 weeks, 8 hours a week
• Finished
• Free Online Course