This book is a French translation of seventeen papers by Donald Knuth
on algorithms both in the field of analysis of algorithms and in the
design of new algorithms. They cover fundamental concepts and
techniques and numerous discrete problems such as sorting,
searching, data compression, theorem-proving, and cryptography, as
well as methods for controlling errors in numerical computations.
Donald E. Knuth is the Fletcher Jones Professor of Computer Science
emeritus at Stanford University.