Randomized Algorithms Courses and Certifications

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

68 ratings

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algor…

• Coursera
• 15 hours 25 minutes
• Self-Paced
• Paid Course

• Best of All Time

Institute for Pure & Applied Mathematics (IPAM)

Randomized Algorithms for Rounding and Rank Compression in the Tensor Train Format

Explore randomized algorithms for efficient tensor-train rounding, enhancing performance in quantum systems and condensed matter physics applications with significant computational speedups.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Finding Hidden Messages in DNA (Bioinformatics I)

18 ratings

Explore DNA's hidden messages using computational biology. Learn algorithms to identify replication origins and molecular clocks in bacterial genomes. Apply motif-finding software to real biological data.

• Coursera
• 16 hours
• Self-Paced
• Paid Course

Churchill CompSci Talks

Randomised Computation

Explore probabilistic Turing machines, complexity classes, and efficient randomised algorithms. Dive into Monte Carlo methods, polynomial identity testing, and the P = BPP problem.

• YouTube
• 31 minutes
• Self-Paced
• Free Video

Simons Institute

Randomized Matrix Computations - Themes and Variations Part 1

Explore distinct ways probability enhances numerical linear algebra algorithms through conceptual foundations and interconnected computational problem-solving approaches.

• YouTube
• 1 hour 6 minutes
• Self-Paced
• Free Video

Simons Institute

Randomized Matrix Computations - Themes and Variations Part 2

Explore distinct probability-based design templates for numerical linear algebra algorithms and discover conceptual foundations linking seemingly unrelated computational methods.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

Simons Institute

Approximating the TV Distance Between Two Product Distributions

Explore techniques for approximating total variation distance between high-dimensional product distributions, including randomized coupling and deterministic sparsification methods.

• YouTube
• 44 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Constant-Cost Communication in Randomized Computing

Explore the fascinating role of randomness in communication complexity, focusing on efficient protocols for solving equality problems and their broader implications in computing theory.

• YouTube
• 1 hour 14 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

A Randomized Greedy Algorithm with Certification Over the Entire Parameter Set

Discover a randomized Greedy algorithm for constructing certified local approximation spaces for multiscale PDEs with high probability guarantees.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Career Certificate

Algorithms

5989 ratings at Coursera

Comprehensive introduction to algorithms, covering key concepts and practical applications. Emphasizes conceptual understanding for technical interviews and professional discussions.

• Coursera
• 4 weeks, 10 hours/week
• Self-Paced
• Paid Course
• 4 courses

IEEE

A New Minimax Theorem for Randomized Algorithms

Explore a novel minimax theorem for randomized algorithms, comparing it with Yao's minimax and discussing its implications for algorithm analysis and design.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk

Clemson University

Design and Analysis of Algorithms

38 ratings at Coursera

Master fundamental algorithm design techniques, data structures, and analysis methods through comprehensive exploration of sorting, recursion, hashing, optimization, and graph algorithms.

• Coursera
• 1 day 3 hours 29 minutes
• Self-Paced
• Paid Course

Introduction to Graduate Algorithms

1 rating

Learn advanced techniques for designing algorithms and apply them to hard computational problems.

• Udacity
• 20 hours
• Self-Paced
• Free Online Course

Introduction to Computation Theory

2 ratings

Students will examine the formal mathematics for foundational computation proofs, as well as gain tools to analyze hard computational problems themselves.

• Complexity Explorer
• 1 hour
• Self-Paced
• Free Certificate

ACM SIGPLAN

Randomized Testing of Byzantine Fault Tolerant Algorithms

Explore ByzzFuzz, a randomized testing method for detecting errors in Byzantine fault-tolerant algorithms. Learn how it uncovers protocol and implementation bugs in blockchain systems through innovative message mutations.

• YouTube
• 18 minutes
• Self-Paced
• Free Video