Donald E. Knuth has been making foundational contributions to the field of computer science for as long as computer science has been a field. His award-winning textbooks are often given credit for shaping the field, and his scientific papers are widely referenced and stand as milestones of development for a wide variety of topics. The present volume, the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. Nearly thirty of Knuth's classic papers are collected in this book and brought up to date with extensive revisions and notes on subsequent developments. The papers cover numerous discrete problems, such as assorting, searching, data compression, theorem proving, and cryptography, as well as methods for controlling errors in numerical computations.

Acerca del autor

Donald E. Knuth is the Fletcher Jones Professor of Computer Science emeritus at Stanford University.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

We carry a comprehensive range of out of print and rare books.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Kennys Bookshops and Art Galleries Limited
Liosban Industrial Estate, Tuam Road, Galway, GY, Ireland

Condiciones de venta y env�o

Condiciones de venta

We guarantee the condition of every book as it's described on the Abebooks websites.

If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date.

For any queries please use the contact seller link or send an email to books@kennys.ie

Conor Kenny