The Art of Computer Programming

By W. Worlton. 1968

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

Citations in the corpus

Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “We extended it by implementing the Karatsuba multiplication algorithm [38].”
Revisiting Batch Normalization For Practical Domain Adaptation (2016, methodology): “In practice we adopt an online algorithm (Donald 1999) to efficiently estimate the mean and variance.”
Problem Solving by Heterogeneous Agents (2001, methodology): “In the case of the present model, the issue of whether it captures those aspects of diversity of thought which are most relevant to group problem solving is left to the reader's discretion.”
ON MINIMAL DECOMPOSITION OF p-ADIC POLYNOMIAL DYNAMICAL SYSTEMS (2010, background): “One of interesting problems well studied in the literature is the minimality of the system f : Zp → Zp, which corresponds to the situation where A = C = ∅ and B consists of one minimal component ([1, 2, 3, 4, 10, 12, 21, 22, 23, 25, 27, 29]).”
Applications of Probabilistic Programming (Master's thesis, 2015) (2016, methodology): “The corpus was manually prepared and was based on one-dimensional distribution sampler code from (Devroye, 1986; Box and Muller, 1958; Knuth, 1998).”
Benford's law, values of L-functions and the 3x+1 problem (2004, result): “See [Hi1] for a description and history, [Hi2, BBH] for some recent results, and page 255 of [Knu] for connections between Benford’s law and rounding errors in computer calculations.”
The Algorithm Design Manual (2020, background): “[GKP89] R. Graham, D. Knuth, and O. Patashnik.”