Randomized Algorithms Courses and Certifications

Introduction to Computation Theory

2 reviews

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
• On-Demand
• Free Online Course

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
• On-Demand
• Free Video

Squid: Schools for Quantum Information Development

Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra

Explore quantum algorithms for matrix sampling and linear algebra operations using minimal qubits, focusing on efficient methods without quantum data structures for practical quantum computing applications.

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

CS251: Great Ideas in Theoretical Computer Science

Explore fundamental computation theory through finite automata, complexity analysis, P vs NP, cryptography, and the mathematical foundations that define computational limits.

• Independent
• On-Demand
• Free Online Course

NPTEL;  IIT Roorkee

Introduction to Cryptology

1 review

Explore cryptology fundamentals, including ciphers, perfect secrecy, public key systems, and hash functions. Learn algorithms and techniques for secure communication and data protection.

• YouTube
• 10 hours
• On-Demand
• Free Video

Strange Loop Conference

Compacting the Uncompactable

Innovative memory allocation technique eliminating fragmentation in C/C++ programs, reducing memory consumption and improving performance without modifying existing code.

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

Centre International de Rencontres Mathématiques

Nexus of Information and Computation Theories - IHP Spring 2016 Thematic Program

Explore the intersection of information theory and computational theory through expert tutorials covering algorithmic inference, tensor decompositions, communication complexity, and privacy methods.

• YouTube
• 16 hours 25 minutes
• On-Demand
• Free Video

UofU Data Science

Advanced Algorithms (Fall 2019)

Master sophisticated algorithmic techniques and computational problem-solving strategies through comprehensive university-level lectures covering advanced topics in algorithm design and analysis.

• YouTube
• 1 day 10 hours 46 minutes
• On-Demand
• Free Video

Simons Institute

Foundations of Data Science II

Explore advanced data science concepts including SVD, Gaussian mixtures, and Markov chains. Learn about randomized algorithms and low-rank approximations for efficient data handling.

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

NPTEL-NOC IITM

Karger's Mincut Algorithm - Introduction and Implementation

Explore Karger's mincut algorithm, its motivation, problem definition, and implementation through a practical example.

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

Churchill CompSci Talks

Sublinear Time Property Testers - Algorithms for Efficient Function Analysis

Explore sublinear time property testers for efficient algorithm design. Learn about relaxed decision problems, fast testers, and applications in graph theory and string processing.

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

Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 2

Explore advanced sketching techniques for data structures and optimization in fast algorithms, focusing on practical applications and theoretical foundations.

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

Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 1

Explore data structure optimization techniques for fast algorithms, focusing on sketching methods to enhance computational efficiency and performance.

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

IEEE

Towards Optimal Separations between Quantum and Randomized Query Complexities

Explore the intriguing gap between quantum and randomized query complexities, delving into cutting-edge research on optimal separations and their implications for computational theory.

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

Association for Computing Machinery (ACM)

Nearly Optimal Static Las Vegas Succinct Dictionary

Explore advanced data structures for efficient dictionary operations, focusing on succinct representations and optimizing space usage for various input types.

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