Association for Computing Machinery (ACM) Courses

Graph Theory and Algorithms

Explore graph theory fundamentals, Kcut algorithms, and weighted min cut problems in this comprehensive overview of advanced algorithmic concepts.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Privacy and Fairness

Explore differential privacy, stochastic optimization, and fairness in algorithms. Learn about new techniques, applications, and the importance of interaction in privacy-preserving machine learning.

• YouTube
• 45 minutes
• On-Demand
• Free Video

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Dynamic Algorithms

Explore advanced graph algorithms, including ES trees, balanced embeddings, and dynamic meshing, with applications to real-world problems like densest subgraph and direction.

• YouTube
• 54 minutes
• On-Demand
• Free Video

Does Learning Require Memorization? A Short Tale About a Long Tail

Explore the relationship between learning and memorization in machine learning, focusing on dataset fitting, interpolation, and long-tailed data distribution challenges.

• YouTube
• 25 minutes
• On-Demand
• Free Video

Algorithms for Heavy-Tailed Statistics - Regression, Covariance Estimation, and Beyond

Explore advanced statistical techniques for handling heavy-tailed data, including regression and covariance estimation, with a focus on SOS assumptions and median of means framework.

• YouTube
• 20 minutes
• On-Demand
• Free Video

Interaction Is Necessary for Distributed Learning with Privacy or Communication Constraints

Explore distributed learning challenges with privacy and communication constraints, focusing on interactive vs non-interactive approaches and their impact on sample complexity and statistical queries.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Near-Optimal Fully Dynamic Densest Subgraph

Explore near-optimal algorithms for dynamic densest subgraph problems, covering applications, definitions, and techniques for efficient graph orientation and load balancing.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Dynamic Algorithms for LIS and Distance to Monotonicity

Explore dynamic algorithms for Longest Increasing Subsequence and Distance to Monotonicity, covering Patience Sorting, runtime improvements, and grid packing techniques.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture

Explore semi-algebraic proofs, IPS lower bounds, and the τ-Conjecture in computational complexity theory, focusing on proof systems and algebraic circuits.

• YouTube
• 29 minutes
• On-Demand
• Free Video

The Impossibility of Efficient Quantum Weak Coin Flipping

Explore quantum coin-flipping, its history, and recent developments in point games, profile functions, and communication rounds in quantum protocols.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

Explore quantum-inspired classical algorithms for machine learning, focusing on sublinear low-rank matrix arithmetic and singular value transformation techniques.

• YouTube
• 21 minutes
• On-Demand
• Free Video

On the Nisan-Ronen Conjecture for Submodular Valuations

Explore the Nisan-Ronen conjecture for submodular valuations, covering scheduling mechanisms, player valuations, and related proofs in algorithmic game theory.

• YouTube
• 26 minutes
• On-Demand
• Free Video

An Improved Approximation Algorithm for ATSP

Explore an advanced approximation algorithm for the Asymmetric Traveling Salesman Problem, covering linear programming relaxation, reductions, and recursive techniques to improve solution quality.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Constant Factor Approximations to Edit Distance in Nearly Linear Time

Explore efficient algorithms for approximating edit distance in near-linear time, merging insights from two papers to tackle dense and sparse graph scenarios.

• YouTube
• 24 minutes
• On-Demand
• Free Video