Trees, Forests and Rearranging

1960/02/01 by P. F. Windley · 3 citations
Computer Science · #Algorithms and Data Compression #Data Mining Algorithms and Applications #Evolutionary Algorithms and Applications

paper · doi:10.1093/comjnl/3.2.84

openalex publication_date 1960/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06

Abstract

This paper describes a method of rearranging data in a computer, so as to minimize the amount of storage space used. Expressions for the mean and variance of the numbers of comparisons necessary, are produced. These are compared with the number of comparisons required in a merging procedure.

Cited by

• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• The use of hierarchic clustering in information retrieval
• Binary search tree [wikipedia]