The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An explicit universal cycle for the (n-1)-permutations of an n-set
ACM Transactions on Algorithms (TALG)
Auspicious Tatami mat arrangements
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
Shift gray codes
| Hi-index | 0.00 |
Donald Knuth's magnum opus, The Art of Computer Programming (TAOCP), is often bought, frequently cited, sometimes browsed, occasionally read, but almost never used for teaching. The purpose of this paper is to describe the author's experience in teaching two courses, each based on different sections of TAOCP volume 4a, using the pre-fascicles and fascicles that were available at the time. The conclusion reached is that such an adventurous undertaking can be extremely rewarding, not only for the students, but also for the instructor.