Date: 
Tuesday, December 2, 2014 - 6:00pm to 7:00pm

Professor Knuth will present his 20th Annual Christmas Tree Lecture on Tuesday, December 2, 2014 at 6:00 pm in NVIDIA Auditorium in Huang Engineering Center, 475 Via Ortega, Stanford University . For those unable to come to Stanford, the lecture will be broadcast online as a free webinar. If you would like to view the live broadcast, please register so that we can send you the link prior to the event.

In previous lectures I've discussed binary trees, ternary trees, quaternary trees, etc., which are enumerated by the coefficients of important functions called generalized binomial series of order 2, 3, 4, etc. What happens when we consider generalized binomial series of order 3/2, or of other fractional orders? The answer is pretty amazing.

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.

Register Today!