Computer Musings

I occasionally give lectures at Stanford during the academic year.
These lectures are
open to the public as well as to
students and faculty. No tuition is charged, no attendance is taken,
no credit is given.
Each talk
is independent of the others, and pitched at an audience of non-specialists.
Sometimes I talk about difficult technical issues, but I try to minimize
the jargon and complications by stressing the motivation
and the paradigms and the high-level picture, without sweeping the
details entirely under the rug.

The next talk in the series will be scheduled during 2015.

Musings Online

Great news! Videotapes were made of many past lectures in this
series, and the
Stanford Center for Professional
Development has offered to host a permanent archive of digitized
versions, freely
viewable from their website.
This work is still in progress, but dozens of webcasts are already
ready for streaming. Many of these are in fact also available via
iTunes!

Here is a reverse-chronological list of all previous lectures in the series.
If I subsequently wrote a related paper on the topic, the number of that paper
in my
list of publications
is given in brackets. Links to downloadable source files are also
shown when the sources are available.
Lectures available online are
marked with "***".

Topological Sorting Revisited [see Algorithm 7.2.1.2V in
The Art of Computer Programming]
[If you are the person who borrowed the master tape, please
please return it so that Stanford can put this lecture online!]

Dec 06 2001

Totally Acyclic Digraphs (Spiders) and how to squish them
[see the reprint of P160 in
Selected Papers on Computer Languages,
Chapter 25, and the program
SPIDERS]
[If you are the person who borrowed the master tape, please
please return it so that Stanford can put this lecture online!]

May 10 2001

Twisted Toruses: or, Tori! Tori! Tori! [will eventually be
discussed in exercise 7--137 of
The Art of Computer Programming]
[If you are the person who borrowed the master tape, please
please return it so that Stanford can put this lecture online!]