Derandomization Courses and Certifications

Simons Institute

Derandomization: A Quick Tutorial

Explore efficient methods for transforming interactive protocols into NP-type verifiers, using targeted pseudorandom generators and complexity-theoretic assumptions.

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

Centre International de Rencontres Mathématiques

Derandomization: Pseudo-randomness from Hardness - Part 1

Explore pseudo-randomness from hardness in derandomization with Valentine Kabanets. Gain insights into this mathematical concept through a comprehensive tutorial.

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

Centre International de Rencontres Mathématiques

Derandomization and Meta-complexity - Part 2

Explore meta-complexity in derandomization through an advanced tutorial. Delve into cutting-edge mathematical concepts and their applications in randomness and complexity theory.

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

Fields Institute

Towards Free Lunch Derandomization from Necessary Assumptions and OWFs

Explore advanced derandomization techniques using necessary assumptions and one-way functions in computational complexity theory.

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

Institute for Advanced Study

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen

Explore advanced topics in computational complexity, including circuit lower bounds, derandomization, and their connections. Gain insights into cutting-edge research and theoretical developments in computer science.

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

TheIACR

A Note on Perfect Correctness by Derandomization

Explore derandomization techniques for achieving perfect correctness in cryptographic schemes, focusing on public-key encryption and the concept of cryptographic strings.

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

IEEE

Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization

Explore groundbreaking research on circuit complexity theory, focusing on the connection between derandomization techniques and establishing lower bounds for circuit sizes across various computational models.

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

IEEE

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds

Explore connections between computational complexity theories, focusing on exponential-time hypotheses, derandomization techniques, and circuit lower bounds in theoretical computer science.

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

Ryan O'Donnell

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.

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

Association for Computing Machinery (ACM)

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization

Explore circuit lower bounds and derandomization, focusing on AC circuits, algorithmic methods, and pseudorandom generators. Learn about recent developments in average-case circuit analysis.

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

IEEE

Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

Explore deterministic distributed algorithms for expander decompositions and routing, with applications in derandomization. Learn about balanced sparse cut algorithms and recursive techniques.

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

Fields Institute

On a Full Derandomization of Treaps

Explore the full derandomization of treaps in this mathematical analysis presented at the AofA 2025 conference.

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

International Centre for Theoretical Sciences

Concentration on HDX - Derandomization Beyond Chernoff

Explore advanced derandomization techniques in high dimensional expanders that go beyond traditional Chernoff bounds, presented by Max Hopkins at ICTS.

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

Institute for Advanced Study

Concentration on HDX: Derandomization Beyond Chernoff - Lecture

Explore advanced derandomization techniques beyond Chernoff's bound, focusing on high-dimensional expanders and their applications in theoretical computer science and complexity theory.

• YouTube
• 2 hours 8 minutes
• On-Demand
• Free Video

Centre for Networked Intelligence, IISc

Decoupling Theorem in Quantum Information Theory - Application and Derandomization

Explore the decoupling theorem in quantum information theory, its applications in channel capacity, and derandomization using pseudo-random unitaries for efficient quantum processing.

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