Advanced Algorithms Courses and Certifications

Association for Computing Machinery (ACM)

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

Simons Institute

Fast Spectral Algorithms from Sum-of-Squares Analyses

Explore efficient spectral algorithms derived from sum-of-squares analyses, focusing on hierarchies, extended formulations, and matrix-analytic techniques in computational complexity.

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

Advanced Algorithms and Complexity

692 ratings at Coursera

Explore advanced algorithms for network flows, linear programming, NP-complete problems, and streaming. Learn to solve complex computational challenges and optimize real-world systems efficiently.

• Coursera
• 1 day 3 hours 15 minutes
• On-Demand
• Free Online Course (Audit)

NP-Complete Problems

Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.

• edX
• 3 weeks, 8-10 hours a week
• On-Demand
• Free Online Course (Audit)

Enhance Python skills with advanced algorithms and data structures, including deques, string searching, trees, and Hamiltonian algorithms for efficient problem-solving and software development.

• Codecademy
• 6 hours
• On-Demand
• Free Trial Available

Simons Institute

Efficient Zero Knowledge Proof from Interactive Proofs

Explore efficient zero-knowledge proofs derived from interactive proofs, focusing on new algorithms, performance improvements, and comparisons to existing systems.

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

Institute for Pure & Applied Mathematics (IPAM)

Fast Algorithm for the Strong-Interaction Limit of Density Functional Theory

Explore a novel algorithm for computing the strong-interaction limit in density functional theory, enhancing accuracy in modeling strongly correlated systems and overcoming computational challenges.

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

Evolving Themes in Network Orchestration - An Operator's Perspective

Explore network orchestration's evolution, cloud technologies in telecom, and advanced algorithms from an operator's viewpoint, offering insights into telco expectations and future trends.

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

Alan Turing Institute

New Challenges in Computational Statistics

Explore cutting-edge computational statistics challenges and innovations in this lecture by Professor Gareth Roberts, focusing on complex data analysis and algorithm advancements in statistical science.

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

Hausdorff Center for Mathematics

Linear Matroid Matching in the Oracle Model

Explores linear matroid matching in the oracle model, replacing linear algebraic computation with repeated oracle-calls along alternating paths to solve challenging problems in connectivity, rigidity, and count matroids.

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

IEEE

Approximating Constraint Satisfaction Problems on High Dimensional Expanders

Explore high-dimensional expanders and their role in approximating constraint satisfaction problems, with insights on natural collections and general expanders.

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

IEEE

Polylogarithmic Guarantees for Generalized Reordering Buffer Management

Explore polylogarithmic guarantees for generalized reordering buffer management, covering special cases, previous work, and applications in scheduling block devices.

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

IEEE

Unit Capacity Maxflow in Almost m - 4/3 Time

Explore advanced algorithms for solving unit capacity maxflow problems, featuring innovative techniques and improved time complexity.

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

IEEE

Near-Optimal Decremental SSSP in Dense Weighted Digraphs

Explore near-optimal algorithms for maintaining shortest paths in dense weighted digraphs as edges are deleted, focusing on efficient update times and approximation techniques.

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

CppNow

C++ in Space Plasma Model Development

Explore space plasma modeling using C++11, covering numerical methods, advanced algorithms, and concurrency for efficient simulations in astrophysics and space weather.

• YouTube
• 1 hour 13 minutes
• On-Demand
• Conference Talk