Knuth D.E. Selected papers on design of algorithms

Stanford: CLSI, 2010. — 469 p.Robert W Floyd, in Memoriam
he Bose-Nelson Sorting Problem
A One-Way, Stackless Quicksort Algorithm
Optimum Binary Search Trees
Dynamic Huffman Coding
Inhomogeneous Sorting
Lexicographic Permutations with Restrictions
Nested Satisfiability
Fast Pattern Matching in Strings
Addition Machines
A Simple Program Whose Proof Isn’t
Verification of Link-Level Protocols
A Problem in Concurrent Programming Control
Optimal Prepaging and Font Caching
A Generalization of Dijkstra’s Algorithm
Two-Way Rounding
Matroid Partitioning
Irredundant Intervals
Simple Word Problems in Universal Algebras
fficient Representation of Perm Groups
An Algorithm for Brownian Zeros
Semi-Optimal Bases for Linear Dependencies
Evading the Drift in Floating-Point Addition
Deciphering a Linear Congruential Encryption
Computation of Tangent, Euler, and Bernoulli Numbers
Euler’s Constant to 1271 Places
Evaluation of Polynomials by Computer
Minimizing Drum Latency Time