ConceptTheory & Algos
Randomized algorithm
An algorithm that employs a degree of randomness as part of its logic.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Ryan O'Donnell
An algorithm that employs a source of randomness to make decisions during its execution.Erik Demaine & Srini Devadas
An algorithm that generates random numbers and makes decisions based on their values.Tom Leighton
An algorithm whose strategy depends on a coin flip or guessing a value to potentially achieve a better outcome.Ankur Moitra
An algorithm that employs a degree of randomness as part of its logic, meaning its output or runtime can vary across different executions.Andy Pavlo
Perform a random walk over a solution space of all possible valid plans for a query until a cost threshold is reached or the optimizer runs for a length of time.
Lectures that assume it
25The first 12 are shown.
- Pseudorandom Generators
- Epsilon-Biased Generators
- Expander Graph Application 2: Derandomization
- Models of Computation, Random Access Machine & Document Distance
- Local Node Differential Privacy
- Broadcast Algorithms
- CSP Approximability: Optimization and Certification
- BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
- Razborov Smolensky Lower Bounds for AC0[p]
- Differential Privacy: Fundamentals to Forefront I
- Randomization: Skip Lists
- Toda's 1st Theorem and the Permanent
Connections
41The lectures that define it or assume it, and the concepts next to it.
Concepts10
Show 4 moreShow fewer
Lectures31
- Randomized Complexity: RP, coRP, and ZPP
- Randomization: Matrix Multiply, Quicksort
- Query Optimizer Implementation 2
- Random Variables
- Tail Bounds
- Beyond Worst-Case Analysis
Show 25 moreShow fewer
- Pseudorandom Generators
- Epsilon-Biased Generators
- Expander Graph Application 2: Derandomization
- Models of Computation, Random Access Machine & Document Distance
- Local Node Differential Privacy
- Broadcast Algorithms
- CSP Approximability: Optimization and Certification
- BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
- Razborov Smolensky Lower Bounds for AC0[p]
- Differential Privacy: Fundamentals to Forefront I
- Randomization: Skip Lists
- Toda's 1st Theorem and the Permanent
- Instance Checking and the Permanent
- Dictator Testing and the FKN Theorem
- Privacy Amplification for Correlated-Noise Mechanisms via b-Min-Sep Subsampling
- Efficient Fine-Grained Algorithms
- Strange Gaps in the Local Time Hierarchy
- Course Introduction and Overview
- Boolean Satisfiability (SAT)
- Probabilistic Complexity Classes
- Mathematics and Computation: The Landscape of P vs. NP
- All Non-Trivial Variants of 3-LDT
- Quantum Complexity
- Constraint Satisfaction Problems
- Foundations, Privacy & Generalization Challenges in Modern Machine Learning