Lista de obras - Donald Knuth - Dominio Público Uruguay

5X5X5 Word Cubes By Computer ⬇️

article published in Word Ways magazine

A Course on METAFONT Programming ⬇️

A Permanent Inequality

A Punk Meta-Font ⬇️

A bijection for ordered factorizations

artículo científico publicado en 1990

A generalization of Dijkstra's algorithm

artículo científico publicado en 1977

A imaginary number system

artículo científico publicado en 1960

A recurrence related to trees

artículo científico publicado en 1989

A sequence of series for the Lambert W function

article

A short proof of Darboux's lemma

artículo científico publicado en 1989

ALGOL 60 confidential

artículo científico publicado en 1961

AMS Euler - A new typeface for mathematics

artículo científico publicado en 1989

Algorithmic Thinking and Mathematical Thinking

Algorithms / Donald E. Knuth. - (1977)

artículo científico publicado en 1977

An analysis of alpha-beta pruning

article

Ancient Babylonian algorithms

artículo científico publicado en 1972

Another enumeration of trees

artículo científico publicado en 1968

Axioms and Hulls

article

Big Omicron and big Omega and big Theta

Breaking Paragraphs Into Lines

article published in 1981

Complexity results for bandwidth minimization

artículo científico publicado en 1978

Computation of Tangent, Euler, and Bernoulli Numbers

artículo científico publicado en 1967

Computer Science and Its Relation to Mathematics

scholarly article by Donald Knuth published April 1974 in American Mathematical Monthly

Computer programming as an art

Computers and Typesetting

Concrete Mathematics

libro de Ron Graham

Concrete Mathematics, 1989 edition

book by Graham, Knuth and Patashnik from 1989 (1988)

Concrete Mathematics, 1994 edition ⬇️

Digital Typography

book published 1999 with collection of Donald Knuth's writings

Enumeration of plane partitions

artículo científico publicado en 1972

Euler's constant to 1271 places

artículo científico publicado en 1962

Evaluation of Porter's constant

article published in 1976

Fast Pattern Matching in Strings

article

Fibonacci Multiplication

Finite semifields and projective planes

artículo científico publicado en 1965

George Forsythe and the development of computer science

article

Johann Faulhaber and Sums of Powers

Knuth–Plass line-breaking algorithm

algorithm

Leaper Graphs

Length of strings for a merge sort

artículo científico publicado en 1963

Linear Probing and Graphs

Literate Programming

Literate Programming ⬇️

journal article from 'The Computer Journal' published in 1984

Man or boy test

subroutine in Algol 60, written by Donald Knuth to check the correctness of compiles regarding recursion and nonlocal references

Mathematical Vanity Plates

Mathematical typography

artículo científico publicado en 1979

Mathematical typography

Notes on generalized Dedekind sums

On the LambertW function

On the translation of languages from left to right

artículo científico publicado en 1965

Optimum binary search trees

Permutations, matrices, and generalized Young tableaux

artículo científico publicado en 1970

Plain TeX

Knuth's all-purpose example macro package for TeX

RUNCIBLE---algebraic translation on a limited computer

artículo científico publicado en 1959

Randomized incremental construction of Delaunay and Voronoi diagrams

Robert W Floyd, In Memoriam

article

Selected Papers on Computer Science

book by Donald Knuth from 1996

Semantics of context-free languages ⬇️

Semantics of context-free languages: Correction

Semi-optimal bases for linear dependencies

artículo científico publicado en 1985

Serial Isogons of 90 Degrees

Shellsort with three increments

scholarly article by Svante Janson & Donald Knuth published January 1997 in Random Structures and Algorithms

Structured Programming with go to Statements

artículo científico publicado en 1974

Surreal Numbers

libro de Donald Knuth

The Art of Computer Programming, Volume 1: Fundamental Algorithms

first volume of the The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd edition

third edition of the first volume of The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 2: Seminumerical Algorithms

volume of the The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edition

edition of the second volume of The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 3: Sorting and Searching

volume of the The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edition

edition of the third volume of The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

volume of the The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1, 1st edition

edition of volume 4A of The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2

volume of the The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming, Volumes 1-4A Boxed Set

compiled volumes edition of The Art of Computer Programming by Donald E. Knuth

The Complexity of Songs ⬇️

artículo científico publicado en 1977

The Dangers of Computer-Science Theory

academic article

The IBM 650: An Appreciation from the Field

The Sandwich Theorem

The Stanford GraphBase: a platform for combinatorial computing

The TeXbook

libro de Donald Knuth

The TeXbook

book edition (en)

The TeXbook

edition (en)

The Toilet Paper Problem

article

The birth of the giant component

The power of a prime that divides a generalized binomial coefficient

artículo científico publicado en 1989

The problem of compatible representatives

The remaining trouble spots in ALGOL 60

artículo científico publicado en 1967

Things a Computer Scientist Rarely Talks About

libro de Donald Knuth

Things a Computer Scientist Rarely Talks About

2001 edition

Things a Computer Scientist Rarely Talks About

Two Notes on Notation

Typesetting concrete mathematics

scholarly article by D. Knuth published in 1989

Umění programování: 1. díl, Základní algoritmy ⬇️

2008 Czech book edition

Umění programování: 2. díl, Seminumerické algoritmy ⬇️

2010 Czech book edition

backus normal form vs. Backus Naur form

December 1964 scholarly article by Don Knuth in Communications of the ACM

Finite Semifields and Projective Planes ⬇️

tesis de donald knuth

Notación flecha de Knuth

method of notation of very large integers

TeX

sistema de tipografía escrito por Donald E. Knuth

The Art of Computer Programming

libro de Donald Knuth

Web

lenguaje de programación

Lista de obras de Donald Knuth

5X5X5 Word Cubes By Computer ⬇️

A Course on METAFONT Programming ⬇️

A Permanent Inequality

A Punk Meta-Font ⬇️

A bijection for ordered factorizations

A generalization of Dijkstra's algorithm

A imaginary number system

A recurrence related to trees

A sequence of series for the Lambert W function

A short proof of Darboux's lemma

ALGOL 60 confidential

AMS Euler - A new typeface for mathematics

Algorithmic Thinking and Mathematical Thinking

Algorithms / Donald E. Knuth. - (1977)

An analysis of alpha-beta pruning

Ancient Babylonian algorithms

Another enumeration of trees

Axioms and Hulls

Big Omicron and big Omega and big Theta

Breaking Paragraphs Into Lines

Complexity results for bandwidth minimization

Computation of Tangent, Euler, and Bernoulli Numbers

Computer Science and Its Relation to Mathematics

Computer programming as an art

Computers and Typesetting

Concrete Mathematics

Concrete Mathematics, 1989 edition

Concrete Mathematics, 1994 edition ⬇️

Digital Typography

Enumeration of plane partitions

Euler's constant to 1271 places

Evaluation of Porter's constant

Fast Pattern Matching in Strings

Fibonacci Multiplication

Finite semifields and projective planes

George Forsythe and the development of computer science

Johann Faulhaber and Sums of Powers

Knuth–Plass line-breaking algorithm

Leaper Graphs

Length of strings for a merge sort

Linear Probing and Graphs

Literate Programming

Literate Programming ⬇️

Man or boy test

Mathematical Vanity Plates

Mathematical typography

Mathematical typography

Notes on generalized Dedekind sums

On the LambertW function

On the translation of languages from left to right

Optimum binary search trees

Permutations, matrices, and generalized Young tableaux

Plain TeX

RUNCIBLE---algebraic translation on a limited computer

Randomized incremental construction of Delaunay and Voronoi diagrams

Robert W Floyd, In Memoriam

Selected Papers on Computer Science

Semantics of context-free languages ⬇️

Semantics of context-free languages: Correction

Semi-optimal bases for linear dependencies

Serial Isogons of 90 Degrees

Shellsort with three increments

Structured Programming with go to Statements

Surreal Numbers

The Art of Computer Programming, Volume 1: Fundamental Algorithms

The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd edition

The Art of Computer Programming, Volume 2: Seminumerical Algorithms

The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edition

The Art of Computer Programming, Volume 3: Sorting and Searching

The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edition

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1, 1st edition

The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2

The Art of Computer Programming, Volumes 1-4A Boxed Set

The Complexity of Songs ⬇️

The Dangers of Computer-Science Theory

The IBM 650: An Appreciation from the Field

The Sandwich Theorem

The Stanford GraphBase: a platform for combinatorial computing