Some Machines Defined bu Directed Graphs
暂无分享,去创建一个
Abstract This paper considers sorting machines defined by directed graphs. There is a level of description where the operations depend on comparison of real numbers, and a more primitive one on which the operations are in terms of bits. It is shown how the bit processing machines can be transformed into the machines that process real numbers.
[1] de Ng Dick Bruijn,et al. A sorting machine , 1983 .
[2] de Ng Dick Bruijn. Some sorting machines , 1979 .
[3] de Ng Dick Bruijn. Sorting arrays by means of swaps , 1983 .
[4] Vincent Y. Lum,et al. The Rebound Sorter: An Efficient Sort Engine for Large Files , 1978, VLDB.
[5] Martin Rem,et al. A serial sorting machine , 1982 .