2008年06月26日 星期四 14:32
An HTML attachment was scrubbed... URL: <http://www.zeuux.org/pipermail/zeuux-universe/attachments/20080626/815810f1/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: donsmall.gif Type: image/gif Size: 5522 bytes Desc: not available URL: <http://www.zeuux.org/pipermail/zeuux-universe/attachments/20080626/815810f1/attachment.gif>
2008年06月26日 星期四 16:05
还有两篇关于Knuth的八卦: http://sportl.javaeye.com/blog/38156 http://xiaolongy.spaces.live.com/blog/cns!4E5F84165C701F93!361.entry Xia Qingran wrote: > http://www-cs-faculty.stanford.edu/~knuth/musings.html > > > Computer Musings > > ------------------------------------------------------------------------ > > I give more-or-less impromptu lectures about 0.3 times per month at > Stanford when I'm in town 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 probably occur during fall quarter. > > > 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 <http://scpd.stanford.edu/knuth/>. This work is still in > progress, but dozens of webcasts are already available for > beta-viewing. Many of these are in fact also available via iTunes > <http://itunes.stanford.edu/>! > > ------------------------------------------------------------------------ > > 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 > <http://www-cs-faculty.stanford.edu/%7Eknuth/vita.html>is given in > brackets. Links to downloadable source files are also shown when the > sources are available. Lectures available online > <http://scpd.stanford.edu/knuth/> are marked with "***". > > Jun 05 2008 > ***Fun With Binary Decision Diagrams (BDDs); based on material to > appear in Section 7.1.4 of The Art of Computer Programming > Dec 03 2007 > ***Sideways Heaps; based on material to appear in Section 7.1.3 of > The Art of Computer Programming > Jun 06 2007 > ***Cool graphs [based on Section 7 of The Art of Computer Programming] > Dec 06 2006 > ***Trees, Rivers, and RNA (an exposition of the remarkable > constructions in the downloadable programs ZEILBERGER, FRANÇON, > VIENNOT > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs.html#tcb>) > Oct 24 2006 > ***Platologic Computation [subsequently renamed "Broadword > Computation"; based on material to appear in Section 7.1.3 of The > Art of Computer Programming > May 06 2005 > ***Integer Partitions and Set Partitions: A Marvelous Connection > [to appear in exercise 7.2.1.5--27 of The Art of Computer > Programming; see also the CWEB program VACILLATE > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/vacillate.w>] > Dec 13 2004 > ***Sand Piles and Spanning Trees [to appear in exercise > 7.2.1.6--103 of The Art of Computer Programming; see also the CWEB > program SAND > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/sand.w>] > Oct 29 2004 > ***Hooray for Probability Theory (an exposition of the forthcoming > exercises 7.2.1.5--62 and 7.2.1.5--55(b) of The Art of Computer > Programming) > Dec 16 2003 > ***Finding All Spanning Trees [to appear in Section 7.2.1.6 of The > Art of Computer Programming; relevant CWEB programs are GRAYSPAN > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/grayspan.w>, > SPSPAN > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/spspan.w>, > GRAYSPSPAN > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/grayspspan.w>, > SPGRAPH > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/spgraph.w>, > and a MetaPost source file for the documentation > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/spspan.mp>] > ***Oct 17 2003 > Notation [see the reprint of P137 in Selected Papers on Discrete > Mathematics <http://www-cs-faculty.stanford.edu/%7Eknuth/dm.html>, > Chapter 2] > Feb 14 2003 > Ramanujan's cool proof of Bertrand's postulate > Dec 3 2002 > ***Chains of Subsets [to be discussed in Section 7.2.1.6 of The > Art of Computer Programming > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol4>] > Apr 23 2002 > Topological Sorting Revisited [see Algorithm 7.2.1.2V in The Art > of Computer Programming > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol4>] > /[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 > <http://www-cs-faculty.stanford.edu/%7Eknuth/cl.html>, Chapter 25, > and the program SPIDERS > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/spiders.w>] > /[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 > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol4>] > /[If you are the person who borrowed the master tape, please > please return it so that Stanford can put this lecture online!]/ > Dec 5 2000 > ***Trees, Forests, and Polyominoes [see the POLYENUM > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/polyenum.w> > and DAGENUM > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/dagenum.w> > programs] > May 30 2000 > ***The joy of asymptotics [see the Addendum to Chapter 21 in > Selected Papers on Analysis of Algorithms > <http://www-cs-faculty.stanford.edu/%7Eknuth/aa.html>] > Feb 22 2000 > ***Dancing links [P159] TeX file of the paper > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/dancing.tex.gz>; > MetaPost illustrations (B&W;) > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/dance.mp>; > MetaPost illustrations (color) > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/cdance.mp>; > Compressed PostScript (black-and-white version) > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/dancing.ps.gz>; > Compressed PostScript (color version) > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/dancing-color.ps.gz>; > Wassermann's beautiful solutions to the Aztec Diamond challenge > <http://did.mat.uni-bayreuth.de/wassermann/allsolutions.ps.gz> > Mar 3 1999 > ***The MMIX > <http://www-cs-faculty.stanford.edu/%7Eknuth/mmix.html> > architecture simulator: A testbed for buzzword-compliant pipelines > Feb 9 1999 > ***MMIX <http://www-cs-faculty.stanford.edu/%7Eknuth/mmix.html>: A > RISC Computer for the New Millennium > Dec 3 1998 > ***Trees and alphabetic codes [see Sorting and Searching > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol3>, 2nd > edition, Section 6.2.2, the Garsia-Wachs algorithm] CWEB program > for experiments > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/garsia-wachs.w> > Oct 27 1998 > ***Constructing bubblesort at random: one-dimensional particle > physics [see Sorting and Searching > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol3>, 2nd > edition, exercise 5.3.4--40] program for experiments > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/rost.w>, and > another one > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/ran-prim.w> > Jan 20 1998 > ***Fast I/O with many disks, using a magic trick [see Sorting and > Searching > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#vol3>, 2nd > edition, Section 5.4.9] > Dec 3 1997 > ***Lattices of Trees, part I > Oct 29 1997 > ***35 years of (linear) probing [P158] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/lpg.tex.gz>; > video archive of lecture > <http://www.msri.org/publications/ln/hosted/siam/1997/knuth/1/> > Dec 10 1996 > J. J. Sylvester and the matrix tree theorem [see errata to Volume > 1 <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#err1>, > new exercise 2.3.4.2--28] > Oct 8 1996 > Sorting genomes, a simple problem about DNA [see errata to Volume > 3 <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#err3>, > new exercises 5.1.4--41,42,43] > May 3 1996 > Shellsort with three increments: an instructive analysis [P157] > TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/swti.tex.gz> > Dec 5 1995 > frieze patterns and trees [see errata to Volume 1 > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#err1>, new > exercise 2.3-23] > Nov 7 1995 > a randomized adversary for computing the median [see errata to > Volume 3 > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#err3>, new > exercise 5.3.3-26] > Oct 17 1995 > random number generators with quantitative guarantees of quality > [see errata to Volume 2 > <http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html#err2>, new > material in Section 3.5] > Apr 25 1995 > sorting by shorting: Knowlton and Graham's method for identifying > wires in cables [P154] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/kgpp.tex.gz> > Feb 28 1995 > generalized determinants and their relation to perfect matchings > [P156] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/op.tex.gz> > Jan 24 1995 > stable allocation and its relation to uniform hashing [P149] TeX > file <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/easa.tex.gz> > Dec 6 1994 > more fun with binary trees: recursive arithmetic on gigantic > numbers CWEB file > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/tcalc.w.gz> > Nov 8 1994 > independent intervals: an unusual minimax algorithm [P151] CWEB > file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/interval.w.gz>; > change file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/interval-verbose.ch.gz> > > Oct 11 1994 > how to count spanning trees [P150] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/aztec.tex.gz> > Apr 5 1994 > leaper graphs: generalized knights of the rectangular table [P147] > TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/lg.tex.gz> > Nov 30 1993 > the associative law, or the anatomy of rotations in binary trees > [videotape available (cheap!) from University Video Communications > <http://www.uvc.com/>] > Nov 16 1993 > two-way rounding and its surprising connection to network flows > [P145] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/twr.tex.gz> > Oct 26 1993 > the birth of the giant component (the seeds of chaos) [P140] TeX > file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/bgc.tex.gz> > streaming video of similar talk given in 1999 > <http://msri.org/publications/ln/msri/1999/misc/knuth/1/> > Oct 12 1993 > the Gosper-Zeilberger algorithm: a breakthrough in summation > technology > May 4 1993 > some EMACS hacks to make your fingers more powerful > Apr 6 1993 > technical illustrations with MetaPost > <http://cm.bell-labs.com/who/hobby/MetaPost.html>: a high-level > language for PostScript graphics [examples > <http://www-cs-faculty.stanford.edu/%7Eknuth/programs/sgbfig.mp.gz>] > Feb 16 1993 > knight's tours revisited > Jun 2 1992 > $1^m+2^m+\cdots+n^m$ and all that: fascinating facts about power > sums, and the solution of a 360-year-old riddle [P142] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/jfsp.tex.gz> > May 12 1992 > convolution polynomials: their amazing properties and numerous > applications [P141] TeX file > <http://www-cs-faculty.stanford.edu/%7Eknuth/papers/cp.tex.gz> > Mar 10 1992 > The Stanford GraphBase > <http://www-cs-faculty.stanford.edu/%7Eknuth/sgb.html>: A platform > for combinatorial computing > Feb 11 1992 > why CWEB <http://www-cs-faculty.stanford.edu/%7Eknuth/cweb.html> > might become your favorite programming language > Jan 28 1992 > MMIX 2009 <http://www-cs-faculty.stanford.edu/%7Eknuth/mmix.html>: > a RISC computer for the third millennium > > ``It was a musing.'' --- Peter Gordon > > ------------------------------------------------------------------------ > > > <http://www-cs-faculty.stanford.edu/%7Eknuth/preprints.html> > > > -- > 夏清然 > Xia Qingran > qingran at zeuux.org > > ------------------------------------------------------------------------ > > _______________________________________________ > zeuux-universe mailing list > zeuux-universe at zeuux.org > http://www.zeuux.org/mailman/listinfo/zeuux-universe > > ZEUUX Project - Free Software, Free Society! > http://www.zeuux.org -- 夏清然 Xia Qingran qingran at zeuux.org
Zeuux © 2024
京ICP备05028076号