Stanford Lecture: Don Knuth—"Dancing Links" (2018)
Donald Knuth's 24th Annual Christmas Lecture: Dancing Links
Donald Knuth, Professor Emeritus
2018
A simple data-structuring idea called “dancing links” has proved to be surprisingly effective. It has also led to a new class of combinatorial problems, “exact covering with color controls” (or XCC for short), which appears to be quite important. The speaker will explain the basic algorithms and will illustrate them with solutions to dozens of XCC problems that have arisen in a wide variety of applications.
Compare this talk to Knuth's 2000 lecture on Dancing Links: https://www.youtube.com/watch?v=R9gRLnddOBg&feature=youtu.be
Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century.
Видео Stanford Lecture: Don Knuth—"Dancing Links" (2018) канала Stanford Online
Donald Knuth, Professor Emeritus
2018
A simple data-structuring idea called “dancing links” has proved to be surprisingly effective. It has also led to a new class of combinatorial problems, “exact covering with color controls” (or XCC for short), which appears to be quite important. The speaker will explain the basic algorithms and will illustrate them with solutions to dozens of XCC problems that have arisen in a wide variety of applications.
Compare this talk to Knuth's 2000 lecture on Dancing Links: https://www.youtube.com/watch?v=R9gRLnddOBg&feature=youtu.be
Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century.
Видео Stanford Lecture: Don Knuth—"Dancing Links" (2018) канала Stanford Online
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Donald Knuth - My advice to young people (93/97)P vs. NP and the Computational Complexity ZooStanford Lecture: Donald Knuth - All Questions Answered (May 12, 2011)Don Knuth An Amazing New ParadoxStanford Lecture: Donald Knuth - "Bayesian trees and BDDs" (2011)Stanford Lecture - Don Knuth: The Analysis of Algorithms (2015, recreating 1969)Donald Knuth: P=NP | AI Podcast ClipsSurreal Numbers (Don Knuth Extra Footage) - NumberphileDonald Knuth: The Art of Computer Programming | AI Podcast ClipsSimple Message Passing on GraphsStanford Lecture: Don Knuth - "Pi and The Art of Computer Programming" (2019)Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)Introduction to Hilbert Space in Quantum MechanicsDonald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62Donald Knuth - "The Art of Computer Programming": underestimating the size of the book (38/97)Donald Knuth - My maths teacher at Case and a difficult problem (18/97)Quick-sort with Hungarian (Küküllőmenti legényes) folk danceGenetic Algorithms Explained By ExampleQuestions Answered by Donald E. Knuth