
Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks65.7K views
Jim Weirich derives the Y combinator live, step by step, using nothing but Ruby lambdas, and along the way teaches the refactorings of lambda calculus.
267,244 videos · Algorithms, systems, security, machine learning and building software.

65.7K views
Jim Weirich derives the Y combinator live, step by step, using nothing but Ruby lambdas, and along the way teaches the refactorings of lambda calculus.

Advanced143K views
Philip Wadler explains the Curry–Howard correspondence: how logic and programming languages were discovered independently to be the same thing.

95.6K views
Gerald Sussman argues our programs are brittle compared with biological systems and shows propagator networks as an alternative.

Advanced235K views
Chandler Carruth explains that algorithmic complexity and data-structure layout (cache behaviour) both matter, with concrete C++ examples.
1:04:4264.5K views
Introduction to wait-free algorithms: progress guarantees and building a wait-free data structure.

17.8K views
James Long explains CRDTs in practical terms — hybrid logical clocks, last-write-wins maps and merkle trees — from building a local-first app.

184K views
Andrei Alexandrescu explores how to make sorting faster, discovering counterintuitive results about branch prediction and algorithm design.

Advanced29K views
Cliff Click presents a lock-free concurrent hash table that scales to hundreds of CPUs and explains how to reason about its correctness via a state machine.
18:49A 19-minute video from ACM SIGPLAN: “[OOPSLA24] A Learning-Based Approach to Static Program Slicing”.
32:39A 33-minute video from Linux.conf.au 2015 -- Auckland, New Zealand: “Before All Else, Be Graphed”.
39:48Advanced
A 40-minute video from Simons Institute for the Theory of Computing's catalogue; the title names its topic.
3:12A 3-minute video from Gopher Academy: “GopherCon 2017: Regular expressions, do you need them? - Joey Geiger”.
1:10:56A 71-minute video from Mathematics of Kyiv Academic University: “Alina Frolova. Алгоритми вирівнювання коротких послідовностей та їх застосування в біоінформатиці.”.
51:37A 52-minute video from Fields Institute: “Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to DDGPs”.
39:51
46:30A 46-minute video from Jeremy McMahan: “From Knapsacks to Self-Driving: FPTAS Recipes for Constrained Reinforcement Learning”.
1:03:51A 64-minute video from matsciencechannel's catalogue; the title names its topic.
25:49Advanced
A 26-minute video from Fields Institute's catalogue; the title names its topic.
1:04:27A 64-minute video from matsciencechannel's catalogue; the title names its topic.
25:06Advanced
A 25-minute video from SIGACT EC: “STOC 2023 - Session 8B - A PTAS for Minimizing Weighted Flow Time on a Single Machine”.
25:47Advanced
A 26-minute video from ACM SIGPLAN: “[ICFP'25] A Bargain for Mergesorts: How to Prove Your Mergesort Correct and Stable, Almost for Free”.
23:02A 23-minute video from Fields Institute: “Tight bounds for stream decodable error-correcting codes”.
16:26A 16-minute video from ACM SIGPLAN: “Templates and Recurrences - Better Together”.
26:30Advanced
A 26-minute video from Fields Institute's catalogue; the title names its topic.
26:21A 26-minute video from G2OAT: “Foivos Fioravantes: Complexity of Finding Maximum Locally Irregular Induced Subgraphs”.
23:15Advanced
A 23-minute video from Botond Bertok: “MOT Szakmai Napok 2021: Folyamathálózat-szintézis változó bemenet-kimenet arányú egységekkel”.
1:02:18Advanced
A 62-minute video from Institut des Hautes Etudes Scientifiques (IHES): “Benedikt Ahrens - Le principe d'univalence: le transfer du raisonnement à traver les equivalence”.
1:09:23Advanced
A 69-minute video from cpponsea: “Re-Release: Missing (and future?) C++ Range Concepts - Jonathan Müller - C++ on Sea 2025”.
1:00:25Advanced
A 60-minute video from Georgetown Computer Science Colloquium: “Andrea Lincoln. Faster Random k-CNF Satisfiability”.
54:36Advanced
A 55-minute video from Learning and Intelligent Systems Lab, TU Berlin: “Jonathan D. Gammell: Furthering Motion Estimation and Planning in Robotics”.
58:54A 59-minute video from NHR@FAU: “General-Purpose GPU Hashing Data Structures and their Application in Accelerated Genomics”.
18:41Advanced
A 19-minute video from POPL 2019: “Fast and exact analysis for LRU caches”.
32:42A 33-minute video from G2OAT: “Petr Šťastný: Symbolic Execution of Interpreted Languages”.
23:21Advanced
A 23-minute video from Saarland Informatics Campus: “STACS 2021 | Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means”.
26:52A 27-minute video from Fields Institute's catalogue; the title names its topic.
51:53A 52-minute video from IGAFIT: “New lower and upper bounds for quantile summary algorithms”.