Luis Trabb Pardo

TL;DR: The average number of digits in the k th largest prime factor of a random m -digit number is shown to be asymptotically equivalent to the average length of the kTh longest cycle in a permutation on m objects.

TL;DR: This paper surveys the evolution of “high-lever” programming languages during the first decade of computer programming activity and discusses the contributions of Zuse in 1945, Goldstine and von Neumann in 1946, Curry in 1948, and Bauer and Samelson in 1956–1958.

TL;DR: For both trie- and hash-based strategies, a series of representations is introduced which together with the availability of preprocessing reduces the average sizes of the sets to nearly optimal values, yet retains the inherently good retrieval characteristics.

TL;DR: A page printing system in which high level encoded page layout information is processed to form a printed page is described in this paper, where an image processor (3) operates to form page image data, at a variable rate, during a processing time.