Nikhil Sardana

contact

Lectures

Given at Palo Alto High School during winter 2019–20.

• Finite Automata and Turing Machines, written with Bryant Villamil.
• Turing Machines and Mapping Reductions.
• Computational Complexity Theory: P and NP.
• Proving NP-Completeness.

Schedule

~ Cancelled due to COVID-19 ~

• A* search and variants. Minimax, alpha-beta pruning.
• Expectation, bounds. Markov and Chebyshev's Inequalities.
• Law of Large Numbers, CLT. Begin randomized algorithms.
• Analysis of randomized algorithms, Approximate Counting.
• Bloom Filters, Cuckoo Hashing.
• Markov Chains and Monte Carlo Markov Chains.
• Key Exchange, RSA.

← Back to home