In this paper, we prove tight upper and lower bounds on the number or processors, information transfer, wire area and time needed to sort N numbers in a bounded-degree fixed-connection network. Our most important new results are:
No takes yet. Share an insight, caveat, or question.
Tom Leighton (1984) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: