SettingsDonald Knuth
-yllion
-yllion is a proposal from Donald Knuth for the terminology and symbols of an alternate decimal superbase system.
-yllion is a proposal from Donald Knuth for the terminology and symbols of an alternate decimal superbase system.
Computer Modern
Computer Modern is the family of typefaces used by default by the typesetting program TeX. It was created by Donald Knuth with his METAFONT program, and was most recently updated in 1992.
Computer Modern is the family of typefaces used by default by the typesetting program TeX. It was created by Donald Knuth with his METAFONT program, and was most recently updated in 1992.
Concrete Roman
Concrete Roman is a slab serif typeface designed by Donald Knuth using his METAFONT program.
Concrete Roman is a slab serif typeface designed by Donald Knuth using his METAFONT program.
Dancing Links
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
Donald Knuth
Donald Ervin Knuth ( ; born January 10, 1938) is a computer scientist and Professor Emeritus at Stanford University.
Donald Ervin Knuth ( ; born January 10, 1938) is a computer scientist and Professor Emeritus at Stanford University.
Knuth Prize
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after Donald E. Knuth.
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after Donald E. Knuth.
Knuth reward check
Knuth reward checks are awarded by computer scientist Donald Knuth for finding mistakes in, or making suggestions for, his publications.
Knuth reward checks are awarded by computer scientist Donald Knuth for finding mistakes in, or making suggestions for, his publications.
Knuth's Algorithm X
Donald Knuth's Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem represented by a matrix A consisting of 0...
Donald Knuth's Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem represented by a matrix A consisting of 0...
Knuth's up-arrow notation
In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976.
In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976.
Knuth-Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Knuth-Morris-Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Knuth-Morris–Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Knuth–Morris–Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Literate programming
Literate programming is an approach to programming introduced by Donald Knuth as an alternative to the structured programming paradigm of the 1970s.
Literate programming is an approach to programming introduced by Donald Knuth as an alternative to the structured programming paradigm of the 1970s.
Man or boy test
The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language.
The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language.
MIX
MIX is a hypothetical computer used in Donald Knuth's monograph, The Art of Computer Programming (TAOCP).
MIX is a hypothetical computer used in Donald Knuth's monograph, The Art of Computer Programming (TAOCP).
MMIX
MMIX (pronounced em-mix) is a 64-bit RISC instruction set architecture (ISA) designed by Donald Knuth, with significant contributions by John L. Hennessy (who contributed to the design of th...
MMIX (pronounced em-mix) is a 64-bit RISC instruction set architecture (ISA) designed by Donald Knuth, with significant contributions by John L. Hennessy (who contributed to the design of th...
Quater-imaginary base
The quater-imaginary numeral system was first proposed by Donald Knuth in 1955, in a submission to a high-school science talent search.
The quater-imaginary numeral system was first proposed by Donald Knuth in 1955, in a submission to a high-school science talent search.
The Complexity of Songs
"The Complexity of Songs" was an article published by Donald Knuth, an example of an in-joke in computer science, namely, in computational complexity theory.
"The Complexity of Songs" was an article published by Donald Knuth, an example of an in-joke in computer science, namely, in computational complexity theory.
Trabb Pardo-Knuth algorithm
The Trabb Pardo–Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.
The Trabb Pardo–Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.
Trabb Pardo–Knuth algorithm
The Trabb Pardo–Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.
The Trabb Pardo–Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.