. . . "Comparison/exchange modules can be combined to construct networks capable of sorting elements into nondecreasing order. In the paper one considers combinatorial properties of such networks, and we determine the minimum number of modules required to sort eight or less elements. (Author)."@en . . . . . . . . "The Bose-Nelson Sorting Problem"@en . . . . . "(Operations research." . . "Operations Research." . "Computer programming." . . "STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE." . . "Set theory)" . . "Optimization." . . "Operators(mathematics)" . . "Theorems." . . "Asymptotic series." . .