×

zbMATH — the first resource for mathematics

Parallel sorting. (English) Zbl 0507.68035

MSC:
68P10 Searching and sorting
68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Batcher, K.E., Sorting networks and their applications, Proc. AFIPS spring joint computer conf., 32, 307-314, (1968)
[2] Bollobás, B., Graph theory — an introductory course, () · Zbl 0688.05016
[3] B. Bollobás, Random Graphs, to appear.
[4] Bollobás, B.; Rosenfeld, M., Sorting in one round, Israel J. math., 38, 154-160, (1981) · Zbl 0461.05039
[5] Floyd, R.W.; Knuth, D.E., Improved constructions for the Bose-Nelson sorting problem, Notices amer. math. soc., 14, 283, (1967)
[6] Häggkvist, R.; Hell, P., Graphs and parallel comparison algorithms, Congressus numerantium, 29, 497-509, (1980)
[7] Häggkvist, R.; Hell, P., Parallel sorting with constant time for comparisons, SIAM J. comput., 10, 465-472, (1981) · Zbl 0461.68062
[8] R. Häggkvist and P. Hell, Sorting and merging in rounds, Technical Report, Dept. of Computer Science, Simon Fraser University. · Zbl 0493.68060
[9] Knuth, D.E., The art of computer programming, vol.3, sorting and searching, (1973), Addison-Wesley Reading, MA · Zbl 0302.68010
[10] Van Voorhis, D., Ph.D. thesis, (1971), Stanford University
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.