How to do CS Theory
35:51Street Fighting Mathematics
26:10Big O and friends
28:10Harmonic Numbers Asymptotics
22:18Asymptotics Tricks
25:00The Central Binomial Coefficient
1:00:26Birthday Paradox Asymptotics
18:09Factorial Asymptotics, Stirling's Formula
28:26Binomial Coefficients Asymptotics
35:57Central Limit Theorem
24:22Gaussian Random Variables
38:31Berry–Esseen Theorem
16:07Markov and Chebyshev Inequalities
38:22Proof of the Chernoff Bound
24:34Chernoff, Hoeffding, etc. bounds
17:47Computational Models: Turing Machines
25:31Computational Models: Circuits
29:07The Word RAM Model
25:30How to do CS Theory
This lecture provides foundational guidance for graduate-level research in theoretical computer science, discussing essential mathematical and computational concepts. It outlines key texts and academic practices relevant to embarking on a career as a TCS researcher.
How to do CS Theory. Life pro tips on how to be a researcher in Theoretical Computer Science. Lecture 1b of a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
