Center for the Study of Language and Information (2010)
AbstractDonald 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 over 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.
Similar books and articles
When are two algorithms the same?Andreas Blass, Nachum Dershowitz & Yuri Gurevich - 2009 - Bulletin of Symbolic Logic 15 (2):145-168.
Stochastic Algorithms: Foundations and Applications: Third International Symposium, Saga 2005, Moscow, Russia, October 20-22, 2005: Proceedings. [REVIEW]O. B. Lupanov (ed.) - 2005 - Springer.
Is there an ethics of algorithms?Martin Peterson - 2011 - Ethics and Information Technology 13 (3):251-260.
It is not evolution, but a better game would need a better agent.Christian Huyck & Ian Mitchell - 2005 - Behavioral and Brain Sciences 28 (4):499-500.
Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek Ssr, September 16-22, 1979.A. P. Ershov & Donald Ervin Knuth (eds.) - 1981 - Springer Verlag.
Added to PP
Historical graph of downloads