Algorithm Design Courses and Certifications

An Introduction to Logic for Computer Science

10 reviews

Explore propositional logic fundamentals and applications in computer science, enhancing problem-solving skills through hands-on exercises and real-world examples.

• Coursera
• 7 hours 18 minutes
• On-Demand
• Paid Course

Yannic Kilcher

Tree of Thoughts - Deliberate Problem Solving with Large Language Models

Explores Tree-of-Thoughts prompting, enhancing language models' problem-solving abilities through strategic exploration, evaluation, and backtracking across multiple reasoning paths.

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

Master variational algorithm design principles through this comprehensive skills assessment quiz to earn your professional badge.

• IBM Training
• 1 hour
• On-Demand
• Free Online Course

Simons Institute

Optimal Iterative Algorithms for Problems With Random Data

Explore optimal iterative algorithms for statistical problems with random data, focusing on computational complexity and efficient solutions in statistical inference.

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

Simons Institute

Optimal Gradient-Based Algorithms for Non-Concave Bandit Optimization

Explore optimal gradient-based algorithms for non-concave bandit optimization, covering stochastic problems, low-rank linear rewards, and high-order polynomials with applications to reinforcement learning.

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

Simons Institute

Continuous Algorithms - Sampling and Optimization in High Dimension

Explore high-dimensional sampling and optimization techniques, including cutting plane methods, interior-point algorithms, and Riemannian Hamiltonian Monte Carlo, with insights on complexity and open problems.

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

Simons Institute

V-Learning - Simple, Efficient, Decentralized Algorithm for Multiagent RL

Explore efficient decentralized algorithms for multiagent reinforcement learning, focusing on V-learning's ability to overcome challenges in joint action spaces and achieve Nash equilibria.

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

Hausdorff Center for Mathematics

Parameterized Problems Complete for Nondeterministic FPT Time and Logarithmic Space

Exploration of XNLP-complete problems in parameterized complexity, including List Coloring, Scheduling, Bandwidth, and CNF-Satisfiability variants, with implications for W[t]-hardness and long-standing questions.

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

Hausdorff Center for Mathematics

Parametrized Algorithms and Possible Future Directions

Explore current research and future directions in Parameterized Complexity, focusing on algorithmic approaches and potential areas for further investigation.

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

Hausdorff Center for Mathematics

Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II

Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.

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

Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms, Lecture I

Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.

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

Simons Institute

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates

Explore dynamic algorithms for packing-covering LPs using multiplicative weight updates, focusing on near-optimal approximation algorithms and complexity analysis in dynamic settings.

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

Simons Institute

Insights from Engineering Sketches for Production and Using Sketches at Scale

Explore insights on engineering sketches for large-scale production, covering Yahoo's journey in developing and implementing sketching algorithms across multiple languages and platforms.

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

Simons Institute

Streaming Euclidean K-Median and K-Means With O-Log N Space

Innovative algorithm for Euclidean k-median and k-means clustering in data streams, achieving (1+ε)-approximation with significantly reduced memory usage, breaking long-standing space complexity barriers.

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

Simons Institute

Resizable Sketches

Explore techniques for maintaining fixed accuracy in sketches while allowing size growth, addressing challenges in data stream processing and algorithm design.

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