Algorithm Design Courses and Certifications

IIT Kanpur;  NPTEL

Randomized Methods in Complexity

Learn how randomness aids algorithm design and how to eliminate it. Explore circuits, expanders, pseudorandom generators, and error-correcting codes. Ideal for CS, Math, and related fields. 12 weeks with IIT Kanpur.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Become a Machine Learning Specialist

Are you ready to take a deeper dive into mastering the concepts and techniques involved in machine learning? This learning path shows how machine learning algorithms work and how to design them yourself. There's a lot to learn in this rapidly growing (an…

• LinkedIn Learning
• 17 hours
• On-Demand
• Free Trial Available

Sorting Algorithms Mini-Series

Master sorting algorithms and their visualizations in a 5-hour mini-series, covering topics from time and space complexity to ShellSort.

• YouTube
• 5 hours
• On-Demand
• Free Online Course

Web Portfolio Projects: Sortable Table and Arrays

Learn how to build a portfolio piece that addresses some of the common interview questions on arrays, sorting algorithms, and optimizing code performance.

• LinkedIn Learning
• On-Demand
• Free Trial Available

Design and Analysis of Algorithms

Learn to design and analyze algorithms with this concise, less than 1-hour material, covering properties, characteristics, and writing of algorithms.

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

Graham Neubig

Neural Nets for NLP 2020 - Search-Based Structured Prediction

Explore structured prediction, perceptron algorithms, and remedies to exposure bias in this 1-2 hour material by Graham Neubig.

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

Graham Neubig

Neural Nets for NLP 2021 - Building A Neural Network Toolkit for NLP

Learn to implement a minimal neural network toolkit for NLP with Graham Neubig's lecture, covering model definition, graph creation, and parameter update.

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

USENIX

Towards Programming the Radio Environment with Large Arrays of Inexpensive Antennas

Explore wireless communication optimization with Princeton University's Yaxiong Xie, using large arrays of inexpensive antennas to reconfigure the environment. Less than 1-hour workload.

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

IEEE

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning

Explore actively-secure MPC over rings and its applications in private machine learning with this IEEE presentation. Learn about efficient protocols and their implementation in under an hour.

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

IEEE

Theory and Practice of Finding Eviction Sets

Learn to find small eviction sets efficiently with IEEE's material, focusing on micro-architectural attacks. Study novel algorithms and their practical application, improving over the current state-of-the-art.

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

AAAS Annual Meeting

Searching for the Emergence of Life-like Behaviors in Chemical Networks - Stephanie Colón-Santos - AAAS Annual Meeting

Explore prebiotic chemistry with AAAS, focusing on life-like behaviors in chemical networks. Learn about environmental responsiveness, auto-catalysis, self-sustenance, and evolvability in under 1 hour.

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

AAAS Annual Meeting

Develop for Quantum Impact - Krysta Svore - AAAS Annual Meeting

Learn quantum computing and algorithm design from Microsoft's Dr. Krysta Svore in this 1-2 hour material offered by AAAS Annual Meeting.

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

IEEE

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

Explore advanced algorithms for games against nature with Andrew Drucker from the University of Chicago, in a concise, under 1-hour material by IEEE.

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

IEEE

Scheduling with Communication Delays via LP Hierarchies and Clustering

Learn about scheduling with communication delays using LP hierarchies and clustering from experts at IEEE and Microsoft Research. Less than 1-hour workload.

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

IEEE

Revisiting Tardos’s Framework for Linear Programming - Faster Exact Solutions using Approximate Solvers

Explore Tardos's framework for linear programming with IEEE. Learn about polynomial algorithms, variable fixing, and optimization in under an hour.

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