Algorithmic Complexity Courses and Certifications

Black Hat

The Factoring Dead - Preparing for the Cryptopocalypse

Explore cryptographic vulnerabilities, recent breakthroughs in discrete mathematics, and their impact on RSA. Learn how to prepare for potential crypto apocalypse scenarios and operate in a post-RSA world.

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

Simons Institute

The Future of Wireless and What It Will Enable

Explore the future of wireless technology, its potential, and innovative approaches like millimeter waves, small cells, and software-defined networks to overcome current limitations.

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

code::dive conference

Small Lie in Big O

Explore algorithmic complexity, Big O notation, and common misconceptions in performance analysis. Gain insights to improve code efficiency and optimize algorithms.

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

Ruby Central

Service Denied! Understanding How Regex DoS Attacks Work

Explore regex DoS attacks in Rails, understand their mechanics, and learn prevention strategies. Dive into CRuby's regex engine and grasp the underlying principles of regular expressions.

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

Applied Algebraic Topology Network

Nathanael Cox - Effective Algorithms for Quotients of Semi-Algebraic Equivalence Relations

Explore efficient algorithms for computing quotients of semi-algebraic equivalence relations, focusing on complexity, tools, and key results in applied algebraic topology.

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

Simons Institute

Separating Quantum from Classical with K-Fold Forrelation and Friends

Explore quantum-classical separations through k-fold Forrelation, examining l1-Fourier growth and pathwise analysis to understand algorithmic differences and their broader implications in computing.

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

Institute for Pure & Applied Mathematics (IPAM)

Stochastic Vector Methods for Extended Systems - IPAM at UCLA

Explore stochastic vector approaches for electronic structure in condensed matter systems, reducing complexity and enhancing efficiency in computational quantum mechanics.

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

Hausdorff Center for Mathematics

Daniel Dadush- Integer Programming and the Kannan-Lovasz Conjecture

Explore advanced integer programming techniques, lattice theory, and the Kannan-Lovasz conjecture in this high-level overview of solving n-variable integer programs efficiently, with insights into recent progress and key concepts.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Applied Algebraic Topology Network

Barbara Giunti - Average Complexity of Barcode Computation for Vietoris-Rips Filtrations

Explore algorithmic complexity of persistent homology in random Vietoris-Rips filtrations, focusing on boundary matrix fill-up and its implications for computational efficiency.

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

Simons Institute

Sampling in Query Evaluation - Part 2

Explore advanced techniques for efficient query evaluation using sampling methods, focusing on probabilistic approaches and their applications in database theory and AI.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Simons Institute

Sampling in Query Evaluation - Lecture 1

Explore efficient query evaluation techniques using sampling methods to handle large datasets and complex queries in database systems and AI applications.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Simons Institute

Incremental View Maintenance - Part 2

Explore advanced techniques for efficiently updating database views as underlying data changes, focusing on optimization strategies and algorithmic improvements.

• YouTube
• 1 hour 5 minutes
• On-Demand
• Free Video

Simons Institute

Incremental View Maintenance - Part 1

Explore efficient techniques for updating database views as underlying data changes, focusing on algorithmic approaches and their applications in modern data management systems.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

IEEE

Parametric Shortest Paths in Planar Graphs

Explore efficient algorithms for computing shortest paths in planar graphs with varying edge weights, enhancing understanding of graph theory and optimization techniques.

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

Ryan O'Donnell

Approximation Algorithms

Explore approximation algorithms for NP-hard problems, focusing on vertex cover, k-coverage, and traveling salesperson. Learn greedy approaches and their limitations, as well as more advanced techniques.

• YouTube
• 1 hour 14 minutes
• On-Demand
• Free Video