The Art of Computer Programming, Volume II: Seminumerical Algorithms

How researchers see this paper

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

Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead (2020, background): “We will need the following fact about generating Poisson random variables: Lemma 30 ((Knuth, 1981)).”
Random Number Generation (2008, methodology): “In other words, as pointed out by Leeb (1995), every output sequence fails exactly the same number of tests! Viewed from a different angle, it is a restatement of the well-known fact that under H0, each of the 2 possible sequences has the same probability of occurring, so one may argue that none sho”