Courses from 1000+ universities
Two years after its first major layoff round, Coursera announces another, impacting 10% of its workforce.
600 Free Google Certifications
Web Development
Software Development
Graphic Design
Functional Programming Principles in Scala
Mountains 101
Industrial Pharmacy-I
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.
Explore explicit expander graph constructions, including Gabber-Galil, Ramanujan, and Zig-Zag product expanders. Learn about their properties, applications, and mathematical foundations in theoretical computer science.
Explore eigenvalues of the Laplacian and Markov operator in spectral graph theory, including associated formulas and their applications in theoretical computer science research.
Explore spectral graph theory, focusing on minimizing and maximizing quadratic forms, with connections to graph components and bipartiteness in this graduate-level lecture.
Explores spectral graph theory, focusing on the quadratic form associated with undirected graphs. Covers basic setup and provides examples for graduate-level computer science research.
Explore Hamming and Hadamard codes: linear error correction techniques with contrasting rate and distance properties. Learn their applications in theoretical computer science research.
Explore linear error correcting codes, their properties, and applications in computer science theory. Learn about decoding, notation, and minimum distance in this graduate-level lecture.
Explore fundamental axioms of quantum mechanics for quantum computing, covering unitary matrices, qubit gates, and quantum circuits in this graduate-level lecture from Carnegie Mellon University.
Explore Fourier analysis of Boolean functions, focusing on real-valued functions and their Fourier transforms in this graduate-level theoretical computer science lecture.
Explore the Fast Fourier Transform algorithm and its application in efficient integer multiplication, with insights from a CMU graduate-level computer science theory course.
Explore the Word RAM model for algorithms and its impact on integer sorting complexity in this graduate-level lecture on theoretical computer science fundamentals.
Explore Turing Machines as a computational model, covering historical advantages, multitape variations, and key concepts like memory, time, and space bounds in theoretical computer science.
Explore factorial asymptotics and Stirling's Formula in this graduate-level lecture, covering mathematical techniques for theoretical computer science research.
Explore asymptotic notation in theoretical computer science, covering Big O, Omega, and related concepts. Essential for understanding algorithm efficiency and complexity analysis.
Insights and tips for aspiring theoretical computer science researchers, covering research methods, paper writing, presentation skills, and essential resources in the field.
Get personalized course recommendations, track subjects and courses with reminders, and more.