The following pages link to Donald E. Knuth (Q536602):
Displaying 50 items.
- Mathematical vanity plates (Q536603) (← links)
- Nested satisfiability (Q582905) (← links)
- Mathematics for the Analysis of Algorithms. (Q684251) (← links)
- An algorithm for Brownian zeroes (Q786461) (← links)
- The distribution of continued fraction approximations (Q798702) (← links)
- Theory and practice (Q808223) (← links)
- The first cycles in an evolving graph (Q910415) (← links)
- A bijection for ordered factorizations (Q914675) (← links)
- A short proof of Darboux's lemma (Q920228) (← links)
- Mathematics for the analysis of algorithms. (Q927152) (← links)
- A symmetrical Eulerian identity (Q989227) (← links)
- A one-way, stackless quicksort algorithm (Q1082079) (← links)
- Fibonacci multiplication (Q1095961) (← links)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Lexicographic permutations with restrictions (Q1133901) (← links)
- Verification of link-level protocols (Q1154800) (← links)
- The letter S (Q1157974) (← links)
- Huffman's algorithm via algebra (Q1168073) (← links)
- Efficient representation of perm groups (Q1180408) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Axioms and hulls (Q1202183) (← links)
- Complements and transitive closures (Q1218857) (← links)
- Recurrence relations based on minimization (Q1219673) (← links)
- Evading the drift in floating-point addition (Q1220353) (← links)
- Random matroids (Q1220516) (← links)
- An analysis of alpha-beta pruning (Q1238442) (← links)
- Analysis of a simple factorization algorithm (Q1239754) (← links)
- A generalization of Dijkstra's algorithm (Q1240557) (← links)
- Evaluation of Porter's constant (Q1244347) (← links)
- A trivial algorithm whose analysis isn't (Q1245568) (← links)
- The expected linearity of a simple equivalence algorithm (Q1246269) (← links)
- Linear probing and graphs (Q1277382) (← links)
- The sandwich theorem (Q1344393) (← links)
- Aztec diamonds, checkerboard graphs, and spanning trees (Q1361460) (← links)
- Partitioned tensor products and their spectra (Q1361461) (← links)
- A structured program to generate all topological sorting arrangements (Q1393277) (← links)
- The asymptotic number of geometries (Q1394344) (← links)
- (Q1815862) (redirect page) (← links)
- On the Lambert \(w\) function (Q1815863) (← links)
- MMIXware. A RISC computer for the third millennium. (Q1880430) (← links)
- The Knowlton-Graham partition problem (Q1906132) (← links)
- Overlapping Pfaffians (Q1918880) (← links)
- Notes on avoiding ``go to'' statements (Q1945039) (← links)
- Finite semifields and projective planes (Q2394652) (← links)
- Permutations, matrices, and generalized Young tableaux (Q2540557) (← links)
- Subspaces, subsets, and partitions (Q2547207) (← links)
- Optimum binary search trees (Q2551314) (← links)
- Top-down syntax nalysis (Q2551318) (← links)
- An experiment in optimal sorting (Q2552379) (← links)
- Enumeration of plane partitions (Q2555502) (← links)
