Recent News

[click here to zip down to the schedule of public events]

Happy -1+(2/.3)*45*6.78-9

(hint: 2/.3 times 45 times 6.78 is 2034)

(I guess I'm gettin' kinda old: 12.3+.4-5.6+78.9. In fact, I've now lived more than 31415.9265 days.)

TAOCP update

The fourth volume of The Art of Computer Programming deals with Combinatorial Algorithms, the area of computer science where good techniques have the most dramatic effects. I love it the most, because one good idea can often make a program run a million times faster. It's a huge, fascinating subject, and Part 1 (Volume 4A, 883 pages, now in its twenty-third printing) was published in 2011; Part 2 (Volume 4B, 714 pages, now in its second printing) was published at the close of 2022. I'm hoping to make the first 250 or so pages of Volume 4C available early this year, in preliminary paperback format.

While preparing many of the new exercises in Volume 4B, I spent a lot of time attempting to improve on expositions that I found in the literature. And in several noteworthy cases, nobody has yet pointed out any errors. It would be nice to believe that I actually got the details right on my first attempt; but that seems unlikely, because I had hundreds of chances to make mistakes. So I fear that the most probable hypothesis is that nobody has been sufficiently motivated to check the finer points out carefully as yet.

I still cling to a belief that such details are extremely instructive. Thus I would like to enter here a plea for some readers to tell me explicitly, “Dear Don, I have read exercise N and its answer very carefully, and I believe that it is 100% correct,” where N is one of the following exercise numbers:

Please don't be alarmed by the highly technical nature of these examples; more than 500 of the other exercises are completely non-scary, indeed quite elementary. But of course I do want to go into high-level details also, for the benefit of advanced readers. And those darker corners of my books are naturally the most difficult to get right. Hence this plea for help.

Remember that you don't have to work the exercise first. You're allowed to peek at the answer; in fact, you're even encouraged to do so. Please send success reports to the usual address for bug reports ( Thanks in advance!

By the way, if you want to receive a reward check for discovering an error in TAOCP, your best strategy may well be to scrutinize the answers to the exercises that are listed above.

Preliminary sketches of material that will be in later parts of Volume 4C have also been drafted, and courageous readers who have nothing better to do might dare to take a peek at the comparatively raw copy in these “prefascicles.” One can look, for instance, at Pre-Fascicle 8a (Hamiltonian Paths and Cycles); Pre-Fascicle 9b (A Potpourri of Puzzles). Thanks to Tom Rokicki, those PostScript files are now searchable!

Oral histories

I seem to get older every day, and people keep asking me to reminisce about the glorious days of yore. If you're interested in checking out some of those videos and other archives, take a look at my news page for 2020, which I've updated with a few items captured after that year.

Public lectures in 2024

Although I must stay home most of the time and work on yet more books that I've promised to complete, I do occasionally get into speaking mode.

Saturday, January 6, 2024, 4pm to 5pm, in San Francisco (Moscone Center Room 024)
An invited talk, “Recreational Computer Science,” at the Joint Mathematics Meetings [JMM 2024] (view the slides)
Wednesday, August 14, 5pm Argentina time (+3 GMT)
All Questions Answered (via Zoom), as part of the “50th Latin American Computing Conference”, hosted by Universidad Nacional Del Sur in Bahia Blanca, Argentina.

Click here for the “recent news” that was current at the end of 2023, if you're interested in old news as well as new news.

Don Knuth's home page

Valid HTML 4.01 Transitional