youtube algorithm

Writer and artist James Bridle shows how strange and disturbing children's videos on YouTube, from surprise eggs to algorithmic mashups, are produced for ad revenue. He argues they reveal problems in a data-driven internet.

A JSConf 2014 talk visually breaking down algorithms behind everyday UI patterns, such as dropdown menus that vanish when the mouse drifts and picking the nearest target to the cursor. It shows how these are implemented in JavaScript.

Tom Scott's Royal Institution discourse on science communication in the age of social media, how recommendation algorithms shape popularity, and why view counts can matter more than truth. It includes a segment on parasocial relationships.

A PyCon 2012 talk by early YouTube engineer Mike Solomon on how YouTube scaled its architecture, which is mostly Python.

Cuong Do of YouTube describes how a handful of engineers scaled the site, covering hardware, software and database scalability challenges during its rapid growth. The talk was given at the 2007 Seattle Conference on Scalability.

Glenn Vanderburg presents Cló, a Clojure library that reimplements TeX's core typesetting algorithms as composable functions. He shows what translating procedural, literate-programming code into functional form teaches.

Andrei Alexandrescu's CppCon 2019 talk revisits sorting, showing how branchless tricks, hybrid strategies and a cost metric can speed up std::sort-style algorithms on modern hardware.

Technosociologist Zeynep Tufekci argues that the machine-learning systems used to serve ads also decide what political and social information people see. She explains how opaque algorithms can nudge, segment and manipulate users, and warns that the real danger is powerful people using AI to control populations.

Psychologist Robert Epstein presents a Stanford EE380 colloquium on how internet algorithms such as search rankings can manipulate opinions, purchases and votes at massive scale. He also describes a new monitoring system for tracking such influence.

Peter Shor tells the story of how he discovered Shor's Algorithm, from his early mathematics days to the quantum factoring breakthrough. It was recorded at MIT at the Physics of Computation conference.

Chandler Carruth's CppCon 2014 talk on writing fast C++, explaining why data structure choice and memory layout matter more than clever algorithms. It covers why standard containers like unordered_map perform poorly on modern CPUs.

Guy Steele presents a small geometric problem and compares four computational approaches: a classic sequential solution and three parallel-friendly ones. Each is illustrated pictorially and with working code, weighing total work against time to solution.

Sean Parent's GoingNative 2013 talk surveys new and overlooked C++ features and shows how to use them for simple, correct, clear code. It stresses using standard algorithms rather than raw loops.

Chris Stucchio presents the ethical principles behind algorithmic decision making and shows with examples from lending, criminology and education that they cannot all be satisfied at once. The talk frames AI fairness as a set of quantitative tradeoffs.

Bryan Cantrill presents the ARC (Adaptive Replacement Cache) paper by Megiddo and Modha at Papers We Love. He opens with a survey of caching strategies before digging into the self-tuning LRU/MFU design.

Lukas Eder's Devoxx talk on how modern cost-based SQL optimizers rewrite and plan queries in ways developers would not expect. It argues that declarative SQL, used well, can run complex queries very fast.

Eli Pariser's TED talk argues that personalized web services trap users in filter bubbles, limiting exposure to challenging information. He says this is bad for individuals and for democracy.

In a TEDGlobal talk, Raffaello D'Andrea demonstrates quadcopters that play catch, balance, learn and coordinate, using algorithms that treat them like athletes. It includes Kinect-controlled quads.

Jon Bentley walks through three implementations of Hoare's Quicksort, from a dozen-line C function to a series of systematic code transformations that make the program ever simpler and more powerful. It is a Google Tech Talk on code elegance and program derivation.

Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries. It ties together the research and walks through his Haskell succinct library.

Donald Knuth explains at Stanford's CCRMA the constraint-based methods he is using to compose a major work for pipe organ.

Lawyer and musician Damien Riehl argues that music is math with a finite number of melodies, and describes how he and programmer Noah Rubin generated every possible melody and released them under CC0 to avoid accidental infringement claims.

The question-and-answer session that followed Jonathan Blow's talk on dealing with lack of motivation, malaise and depression. It is hosted on YouTube as a mirror of a Twitch recording.

A 2007 Google Tech Talk introducing Polyworld, an artificial life simulator used to evolve artificial intelligence by designing worlds rather than minds. It presents results from ongoing attempts to evolve intelligent behavior.

Eben Moglen's 2011 Personal Democracy Forum talk on the loss of anonymity and privacy on the internet. He proposes building an alternative net of personal servers, the idea behind FreedomBox.

Andrew Ng presents unsupervised feature learning and deep learning, showing how algorithms can learn representations from unlabeled data instead of hand-designed features. He gives examples in vision and audio, including visualizations of features learned by successive layers.

Rich Hickey introduces transducers in Clojure, a way to make map, filter and similar algorithms composable independent of the data source. This avoids duplicated implementations and intermediate collections across sequences, channels and streams.

Julia co-creator Stefan Karpinski explains why multiple dispatch makes Julia code and types reusable across packages with so little friction. He covers sharing basic types and sharing generic algorithms.

Damian Conway's hour-long keynote at the Perl conference, On the Shoulders of Giants, showing off Perl 6 (Raku) features with history, algorithms and a quantum math operator built with grammars. It is delivered with comic flair.

Alan Kay's 1997 OOPSLA keynote, preserved on YouTube after being lost from Google Video. He discusses what object orientation was meant to be, messaging, system design, and the state of computing practice.

Tim Urban's TED talk on why people procrastinate, covering YouTube binges and Wikipedia rabbit holes. It ends with the life-calendar idea as a nudge to act before time runs out.

A short conference talk from !!Con 2017 in which Kevin Chen explains the HDR imaging algorithm from a foundational paper, framing it as a system of linear equations, and implements it in a Microsoft Excel spreadsheet. No prior image processing knowledge is needed.

Conal Elliott presents his paper on automatic differentiation, deriving a simple, generalized AD algorithm from a natural specification. Varying the representation of derivatives yields forward and reverse mode algorithms that avoid the complexity and statefulness of backpropagation.

Martin Kleppmann's QCon London 2018 talk on keeping data consistent in distributed systems without a central leader. It surveys CRDT algorithms for syncing devices and collaborative editing over peer-to-peer networks.

Andrew Adams, a Halide developer, presents the Halide language for image processing and tensor computation. The talk explains the separation of algorithm from schedule with illustrated examples of parallelism, locality and redundancy tradeoffs.

Stephan T. Lavavej's CppCon 2019 talk on implementing floating-point to_chars and from_chars in Microsoft's C++ STL. It covers the history of float-string conversion and the algorithms that make it much faster.

Chandler Carruth walks through tuning C++ performance, from writing benchmarks to analyzing results on real CPUs and compilers. It focuses on small-scale problems such as loop kernels, data structures and algorithms, and on keeping compilers from optimizing benchmarks away.

Martin Kleppmann surveys current research on CRDTs, the algorithms for merging concurrent edits across offline replicas. He covers the hard parts such as rich text, moves and merge results that are technically correct but poor.

Neil Fraser of Google presents Differential Synchronization, the algorithm behind MobWrite, for keeping multiple copies of a document in sync in real time. The talk argues the approach is robust, convergent and efficient.

David Sachs of InvenSense explains how gyroscopes, accelerometers and compasses work on their own and together, demonstrated on a modified Android handset. He covers sensor fusion algorithms and why rotation math such as Euler angles matters.